• International Journal of Contents
• /
• v.16 no.4
• /
• pp.26-38
• /
• 2020

Determining the optimal levels of the technical attributes (TAs) of a product to achieve a high level of customer satisfaction is the main activity in the planning process for quality function deployment (QFD). In real applications, the number of customer requirements for developing a single product is quite large, and the number of converted TAs is also high so the size of the house of quality (HoQ) becomes huge. Furthermore, the TA levels are often discrete instead of continuous and the product market can be divided into several market segments corresponding to the number of HoQ, which also unacceptably increases the size of the QFD optimization problem and the time spent on making decisions. This paper proposed a genetic algorithm (GA) solution approach to finding the optimum set of TAs in QFD in the above situation. A numerical example is provided for illustrating the proposed approach. To assess the computational performance of the GA, tests were performed on problems of various sizes using a fractional factorial design.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.210-218
• /
• 2023

The author presents a simple data-driven intraday technical indicator trading approach based on Genetic Programming (GP) for return forecasting in the Bitcoin market. We use five trend-following technical indicators as input to GP for developing trading rules. Using data on daily Bitcoin historical prices from January 2017 to February 2020, our principal results show that the combination of technical analysis indicators and Artificial Intelligence (AI) techniques, primarily GP, is a potential forecasting tool for Bitcoin prices, even outperforming the buy-and-hold strategy. Sensitivity analysis is employed to adjust the number and values of variables, activation functions, and fitness functions of the GP-based system to verify our approach's robustness.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.6
• /
• pp.506-512
• /
• 2005

Load redistribution algorithm is a critical factor in computer system. In a receiver-initiated Toad redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution including self-adjustable in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

• Journal of Computing Science and Engineering
• /
• v.10 no.4
• /
• pp.118-127
• /
• 2016

An improved sample balanced genetic algorithm and Extreme Learning Machine (iSBGA-ELM) was designed for accurate diagnosis of Alzheimer disease (AD) and identification of biomarkers associated with AD in this paper. The proposed AD diagnosis approach uses a set of magnetic resonance imaging scans in Open Access Series of Imaging Studies (OASIS) public database to build an efficient AD classifier. The approach contains two steps: "voxels selection" based on an iSBGA and "AD classification" based on the ELM. In the first step, the proposed iSBGA searches for a robust subset of voxels with promising properties for further AD diagnosis. The robust subset of voxels chosen by iSBGA is then used to build an AD classifier based on the ELM. A robust subset of voxels keeps a high generalization performance of AD classification in various scenarios and highlights the importance of the chosen voxels for AD research. The AD classifier with maximum classification accuracy is created using an optimal subset of robust voxels. It represents the final AD diagnosis approach. Experiments with the proposed iSBGA-ELM using OASIS data set showed an average testing accuracy of 87%. Experiments clearly indicated the proposed iSBGA-ELM was efficient for AD diagnosis. It showed improvements over existing techniques.

• Communications for Statistical Applications and Methods
• /
• v.27 no.3
• /
• pp.385-395
• /
• 2020

We present a new maximum likelihood approach to estimate demographic history using genomic data sampled from two populations. A demographic model such as an isolation-with-migration (IM) model explains the genetic divergence of two populations split away from their common ancestral population. The standard probability model for an IM model contains a latent variable called genealogy that represents gene-specific evolutionary paths and links the genetic data to the IM model. Under an IM model, a genealogy consists of two kinds of evolutionary paths of genetic data: vertical inheritance paths (coalescent events) through generations and horizontal paths (migration events) between populations. The computational complexity of the IM model inference is one of the major limitations to analyze genomic data. We propose a fast maximum likelihood approach to estimate IM models from genomic data. The first step analyzes genomic data and maximizes the likelihood of a coalescent tree that contains vertical paths of genealogy. The second step analyzes the estimated coalescent trees and finds the parameter values of an IM model, which maximizes the distribution of the coalescent trees after taking account of possible migration events. We evaluate the performance of the new method by analyses of simulated data and genomic data from two subspecies of common chimpanzees in Africa.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1292-1298
• /
• 2017

In this paper, we represent a nonlinear identification of electronic brake pedal behavior in the brake-by-wire (BBW) system based on hybrid group method of data handling (GMDH) and genetic algorithm (GA). A GMDH is a kind of multi-layer network with a structure that is determined through training and which can express nonlinear dynamics as a mathematical model. The GA is used in the GMDH, enabling each neuron to search for its optimal set of connections with the preceding layer. The results obtained with this hybrid approach were compared with different nonlinear system identification methods. The experimental results showed that the hybrid approach performs better than the other methods in terms of root mean square error (RMSE) and correlation coefficients. The hybrid GMDH/GA approach was effective for modeling and predicting the brake pedal system under random braking conditions.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.862-864
• /
• 1996

This paper presents a new approach to evaluate reliability indices of electric distribution systems using genetic algorithm(GA). The use of reliability evaluation is an important aspect of distribution system planning and operation to adjust the reliability level of each area. In this paper, the reliability model is based on the optimal load transferring problem to minimize over load generated load point outage in each sub-section. This kind of the approach is one of the most difficult procedure which becomes a combination problems. A new approach using GA Was developed for this problem. We proposed a tree search algorithm which satisfied the tree constraint. GA is general purpose optimization techniques based on principles inspired from the biological evolution such as natural selection, genetic recombination and survival of the fittest Test results for the model system with 24 nodes and 29 branches are reported in the paper.

• Journal of Information Processing Systems
• /
• v.17 no.4
• /
• pp.690-706
• /
• 2021

Classification is a substantial operation in data mining, and each element is distributed taking into account its feature values in the corresponding class. Metaheuristics have been widely used in attempts to solve satellite image classification problems. This article proposes a hybrid approach, the flower pigeons-inspired optimization algorithm (FPIO), and the local search method of the flower pollination algorithm is integrated into the pigeon-inspired algorithm. The efficiency and power of the proposed FPIO approach are displayed with a series of images, supported by computational results that demonstrate the cogency of the proposed classification method on satellite imagery. For this work, the Davies-Bouldin Index is used as an objective function. FPIO is applied to different types of images (synthetic, Alsat-2B, and Sentinel-2). Moreover, a comparative experiment between FPIO and the genetic algorithm genetic algorithm is conducted. Experimental results showed that GA outperformed FPIO in matters of time computing. However, FPIO provided better quality results with less confusion. The overall experimental results demonstrate that the proposed approach is an efficient method for satellite imagery classification.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.215-221
• /
• 1997

A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.479-484
• /
• 1998

As technology in a computer hardware and software advances, efficient information retrieval from multimedia database gets highly demanded. Recently, it has been actively exploited to retrieve information based on the stored contents. However, most of the methods emphasize on the points which are far from human intuition or emotion. In order to overcome this shortcoming , this paper attempts to apply interactive genetic algorithm to content-based image retrieval. A preliminary result with subjective test shows the usefulness of this approach.