• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제6권4호
• /
• pp.282-287
• /
• 2006

This paper presents an original feature selection method for Emotion Recognition which includes many original elements. Feature selection has some merits regarding pattern recognition performance. Thus, we developed a method called thee 'Interactive Feature Selection' and the results (selected features) of the IFS were applied to an emotion recognition system (ERS), which was also implemented in this research. The innovative feature selection method was based on a Reinforcement Learning Algorithm and since it required responses from human users, it was denoted an 'Interactive Feature Selection'. By performing an IFS, we were able to obtain three top features and apply them to the ERS. Comparing those results from a random selection and Sequential Forward Selection (SFS) and Genetic Algorithm Feature Selection (GAFS), we verified that the top three features were better than the randomly selected feature set.

• Communications for Statistical Applications and Methods
• /
• 제29권6호
• /
• pp.629-640
• /
• 2022

Variable selection is one of the most crucial tasks in supervised learning, such as regression and classification. The best subset selection is straightforward and optimal but not practically applicable unless the number of predictors is small. In this article, we propose directly solving the best subset selection via the genetic algorithm (GA), a popular stochastic optimization algorithm based on the principle of Darwinian evolution. To further improve the variable selection performance, we propose to run multiple GA to solve the best subset selection and then synthesize the results, which we call ensemble GA (EGA). The EGA significantly improves variable selection performance. In addition, the proposed method is essentially the best subset selection and hence applicable to a variety of models with different selection criteria. We compare the proposed EGA to existing variable selection methods under various models, including linear regression, Poisson regression, and Cox regression for survival data. Both simulation and real data analysis demonstrate the promising performance of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3501-3523
• /
• 2017

It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

• 대한산업공학회지
• /
• 제42권5호
• /
• pp.314-326
• /
• 2016

The purpose of variable selection techniques is to select a subset of relevant variables for a particular learning algorithm in order to improve the accuracy of prediction model and improve the efficiency of the model. We conduct an empirical analysis to evaluate and compare seven well-known variable selection techniques for multiple linear regression model, which is one of the most commonly used regression model in practice. The variable selection techniques we apply are forward selection, backward elimination, stepwise selection, genetic algorithm (GA), ridge regression, lasso (Least Absolute Shrinkage and Selection Operator) and elastic net. Based on the experiment with 49 regression data sets, it is found that GA resulted in the lowest error rates while lasso most significantly reduces the number of variables. In terms of computational efficiency, forward/backward elimination and lasso requires less time than the other techniques.

• 대한원격탐사학회지
• /
• 제34권1호
• /
• pp.151-166
• /
• 2018

This paper compares the four selections of performance used in the application of genetic algorithms (GAs) to automatically optimize multispectral pixel cluster for unsupervised classification from KOMPSAT-3 data, since the selection among three main types of operators including crossover and mutation is the driving force to determine the overall operations in the clustering GAs. Experimental results demonstrate that the tournament selection obtains a better performance than the other selections, especially for both the number of generation and the convergence rate. However, it is computationally more expensive than the elitism selection with the slowest convergence rate in the comparison, which has less probability of getting optimum cluster centers than the other selections. Both the ranked-based selection and the proportional roulette wheel selection show similar performance in the average Euclidean distance using the pixel clustering, even the ranked-based is computationally much more expensive than the proportional roulette. With respect to finding global optimum, the tournament selection has higher potential to reach the global optimum prior to the ranked-based selection which spends a lot of computational time in fitness smoothing. The tournament selection-based clustering GA is used to successfully classify the KOMPSAT-3 multispectral data achieving the sufficient the matic accuracy assessment (namely, the achieved Kappa coefficient value of 0.923).

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2002년도 추계 학술발표회 논문집
• /
• pp.175-178
• /
• 2002

A number of controlled selection methods, which have some advantages for practical surveys in considering controls beyond stratification, have developed throughout the last half-century. With respect to the optimization of sampling plan, it is obvious that we may use optimal controlled selection in preference to satisfactory controlled selection. However, there are currently certain restrictions on the employment of optimal controlled selection. We present further research to improve an algorithm for optimal controlled selection and to develop standard software.

• Asian-Australasian Journal of Animal Sciences
• /
• 제13권7호
• /
• pp.883-887
• /
• 2000

One way of evaluating the effectiveness of a dairy breeding program is to measure response to selection. This may be direct or indirect. The objectives of this study were to estimate expected progress for direct selection on milk, fat and protein yields; to estimate the expected correlated responses on indirect selection for milk, fat and protein yields in Zimbabwean Holstein cattle and to establish the effect of selection intensity on responses. The Animal Model contained fixed effects of herd, year of calving, calving month, dry period, milking frequency and additive effects pertaining to cows, sires and dams. AIREML software package was used to analyse the data. The genetic and phenotypic parameters obtained in this study were used to compute direct and correlated responses to selection. Because of the higher heritabilities in first parity, genetic progress was found to be greater when selection was practised on first parity cows as compared to later lactations. It is therefore recommended that older cows in the herd be replaced with improved heifers so as to enhance genetic progress.

• Asian-Australasian Journal of Animal Sciences
• /
• 제29권5호
• /
• pp.640-645
• /
• 2016

The objective of this study was to evaluate the present conventional selection program of a swine nucleus farm and compare it with a new selection strategy employing genomic enhanced breeding value (GEBV) as the selection criteria. The ZPLAN+ software was employed to calculate and compare the genetic gain, total cost, return and profit of each selection strategy. The first strategy reflected the current conventional breeding program, which was a progeny test system (CS). The second strategy was a selection scheme based strictly on genomic information (GS1). The third scenario was the same as GS1, but the selection by GEBV was further supplemented by the performance test (GS2). The last scenario was a mixture of genomic information and progeny tests (GS3). The results showed that the accuracy of the selection index of young boars of GS1 was 26% higher than that of CS. On the other hand, both GS2 and GS3 gave 31% higher accuracy than CS for young boars. The annual monetary genetic gain of GS1, GS2 and GS3 was 10%, 12%, and 11% higher, respectively, than that of CS. As expected, the discounted costs of genomic selection strategies were higher than those of CS. The costs of GS1, GS2 and GS3 were 35%, 73%, and 89% higher than those of CS, respectively, assuming a genotyping cost of $120. As a result, the discounted profit per animal of GS1 and GS2 was 8% and 2% higher, respectively, than that of CS while GS3 was 6% lower. Comparison among genomic breeding scenarios revealed that GS1 was more profitable than GS2 and GS3. The genomic selection schemes, especially GS1 and GS2, were clearly superior to the conventional scheme in terms of monetary genetic gain and profit.

• International Journal of Contents
• /
• 제18권3호
• /
• pp.49-57
• /
• 2022

The purpose of this study was to investigate the satisfaction of personnel selection process according to type of personnel manager and to examine whether the relationship between the type of personnel manager and the satisfaction with the personnel selection process was moderated by the applicant's perception of procedural justice. This study was conducted using a between-group design with 208 students from a four-year university in Korea. One group watched a video in which a human personnel manager selected employees and the other group watched a video in which an AI personnel manager selected employees. Participants were randomly assigned to a condition, responded to a demographic questionnaire, and answered measures of procedural justice and satisfaction with personnel selection after watching the video. As a result, the selection process satisfaction was significantly higher when the human personnel manager conducted the selection process than when the AI personnel manager conducted such process. In addition, when procedural justice was perceived as low, there was a significant difference in satisfaction between human and AI groups. However, when procedural justice was perceived as high, there was no significant difference in satisfaction between the two groups. Based on study results, the significance and limitations of this study and suggestions for future studies are discussed.

• Asian-Australasian Journal of Animal Sciences
• /
• 제21권11호
• /
• pp.1559-1571
• /
• 2008

A rule was developed to constrain the annual rate of inbreeding to a predefined value in a population with different lifetimes between sires and dams, and to maximize the selection response over generations. This rule considers that the animals in a population should be divided into sex-age classes based on the theory of gene flow, and restricts the increase of average inbreeding coefficient for new offspring by limiting the increase of the mean additive genetic relationship for parents selected. The optimization problem of this rule was formulated as a quadratic programming problem. Inputs for the rule were the BLUP estimated breeding values, the additive genetic relationship matrix of all animals, and the long-term contributions of sex-age classes. Outputs were optimal number and contributions of selected animals. In addition, this rule was combined with the optimization of emphasis given to QTL, and further increased the genetic gain over the planning horizon. Stochastic simulations of closed nucleus schemes for pigs were used to investigate the potential advantages obtained from this rule by combining the standard QTL selection, optimal QTL selection and conventional BLUP selection. Results showed that the predefined rates of inbreeding were actually achieved by this rule in three selection strategies. The rule obtained up to 9.23% extra genetic gain over truncation selection at the same rates of inbreeding. The combination of the extended rule and the optimization of emphasis given to QTL allowed substantial increases in selection response at a fixed annual rate of inbreeding, and solved substantially the conflict between short-term and long-term selection response in QTL-assisted selection schemes.