http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Ghosh, Arka,Das, Swagatam,Mullick, Sankha Subhra,Mallipeddi, Rammohan,Das, Asit K. Elsevier 2017 Applied soft computing Vol.57 No.-
<P>Differential Evolution (DE) is currently one of the most competitive Evolutionary Algorithms (EAs) for optimization problems involving continuous parameters. This article presents three very simple modifications to the basic DE scheme such that its performance can be improved and made scalable for optimizing functions having a real-valued moderate-to-high number of variables (dimensions) while focusing on preservation of the simplicity offered by its algorithmic framework. Contrary to the common policies of coupling a complicated scheme for adaptation of the control parameters or introducing additional local search algorithms, we present here a (population member and generation specific) control parameter choosing strategy which uniformly and randomly switches the values of the mutational scale factor and crossover rate between two extremities of their feasible ranges. Furthermore, each population member is mutated either by using the DE/rand/1 scheme or a proposed version of the DE/current-to-best scheme. The mutation scheme for a population member is chosen based on its performance in the current generation. Hence if a mutation strategy successfully replaces a target vector by the corresponding trial vector, then it is reused by the population member of the same index in the following generation, else a switch of mutation method is executed. In the crossover phase, each member undergoes either the common binomial crossover or the BLX-alpha-beta crossover modified for applying in DE, with equal probabilities. Our experiments using the benchmark optimization functions proposed for the IEEE Congress on Evolutionary Computation (CEC) 2013 competition on real parameter optimization and CEC 2010 competition on large-scale global optimization demonstrate that the basic DE optimizer when coupled with these elementary alterations and/or schemes can indeed provide a very competitive result against some of the most prominent state-of-the-art algorithms. (C) 2017 Elsevier B.V. All rights reserved.</P>
Feature Selection Based on Bi-objective Differential Evolution
Sunanda Das,Chi-Chang Chang,Asit Kumar Das,Arka Ghosh 한국정보과학회 2017 Journal of Computing Science and Engineering Vol.11 No.4
Feature selection is one of the most challenging problems of pattern recognition and data mining. In this paper, a feature selection algorithm based on an improved version of binary differential evolution is proposed. The method simultaneously optimizes two feature selection criteria, namely, set approximation accuracy of rough set theory and relational algebra based derived score, in order to select the most relevant feature subset from an entire feature set. Superiority of the proposed method over other state-of-the-art methods is confirmed by experimental results, which is conducted over seven publicly available benchmark datasets of different characteristics such as a low number of objects with a high number of features, and a high number of objects with a low number of features.
Feature Selection Based on Bi-objective Differential Evolution
Das, Sunanda,Chang, Chi-Chang,Das, Asit Kumar,Ghosh, Arka Korean Institute of Information Scientists and Eng 2017 Journal of Computing Science and Engineering Vol.11 No.4
Feature selection is one of the most challenging problems of pattern recognition and data mining. In this paper, a feature selection algorithm based on an improved version of binary differential evolution is proposed. The method simultaneously optimizes two feature selection criteria, namely, set approximation accuracy of rough set theory and relational algebra based derived score, in order to select the most relevant feature subset from an entire feature set. Superiority of the proposed method over other state-of-the-art methods is confirmed by experimental results, which is conducted over seven publicly available benchmark datasets of different characteristics such as a low number of objects with a high number of features, and a high number of objects with a low number of features.