Results 261 to 270 of about 1,270,531 (339)
Some of the next articles are maybe not open access.
Genetic algorithms in feature selection
IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028), 2003We use a genetic algorithm (GA) for the feature selection problem. The method explores the space of possible subsets to obtain the set of features that maximizes the predictive accuracy and minimizes irrelevant attributes. We introduce a multiple correlation in a fitness function used by the GA to evaluate the fitness of each feature subset regarding ...
Yulu Qi, N. Chaikla
openaire +2 more sources
A genetic algorithm for graphical model selection
Journal of the Italian Statistical Society, 1998Graphical log-linear model search is usually performed by using stepwise procedures in which edges are sequentially added or eliminated from the independence graph. In this paper we implement the search procedure as a genetic algorithm and propose a crossover operator which operates on subgraphs. In a simulation study the proposed procedure is shown to
Poli I, Roverato A
openaire +4 more sources
Genetic algorithms as a strategy for feature selection
Journal of Chemometrics, 1992AbstractGenetic algorithms have been created as an optimization strategy to be used especially when complex response surfaces do not allow the use of better‐known methods (simplex, experimental design techniques, etc.). This paper shows that these algorithms, conveniently modified, can also be a valuable tool in solving the feature selection problem ...
LEARDI, RICCARDO+2 more
openaire +3 more sources
Selecting Simulation Algorithm Portfolios by Genetic Algorithms
2010 IEEE Workshop on Principles of Advanced and Distributed Simulation, 2010An algorithm portfolio is a set of algorithms that are bundled together for increased overall performance. While being mostly applied to computationally hard problems so far, we investigate portfolio selection for simulation algorithms and focus on their application to adaptive simulation replication.
Rene Schulz+2 more
openaire +2 more sources
Genetic Algorithm Guided Selection: Variable Selection and Subset Selection
Journal of Chemical Information and Computer Sciences, 2002A novel Genetic Algorithm guided Selection method, GAS, has been described. The method utilizes a simple encoding scheme which can represent both compounds and variables used to construct a QSAR/QSPR model. A genetic algorithm is then utilized to simultaneously optimize the encoded variables that include both descriptors and compound subsets.
Sung Jin Cho, Mark A. Hermsmeier
openaire +2 more sources
International Conference on Telecommunications and Signal Processing, 2019
Android platform due to open source characteristic and Google backing has the largest global market share. Being the world’s most popular operating system, it has drawn the attention of cyber criminals operating particularly through wide distribution of ...
Anam Fatima+4 more
semanticscholar +1 more source
Android platform due to open source characteristic and Google backing has the largest global market share. Being the world’s most popular operating system, it has drawn the attention of cyber criminals operating particularly through wide distribution of ...
Anam Fatima+4 more
semanticscholar +1 more source
Component Selection Using Genetic Algorithms [PDF]
Abstract Genetic algorithms are investigated for use in obtaining optimal component configurations in dynamic engineering systems. Given a system layout, a database of component information from manufacturers’ catalogs, and a design specification, genetic algorithms are used to successfully select an optimal set of components.
Ronald W. Shonkwiler+2 more
openaire +1 more source
Algorithm Selection on Adaptive Operator Selection: A Case Study on Genetic Algorithms
2021The present study applies Algorithm Selection (AS) to Adaptive Operator Selection (AOS) for further improving the performance of the AOS methods. AOS aims at delivering high performance in solving a given problem through combining the strengths of multiple operators.
openaire +2 more sources
Entropy-Boltzmann selection in the genetic algorithms
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2003A new selection method, entropy-Boltzmann selection, for genetic algorithms (GAs) is proposed. This selection method is based on entropy and importance sampling methods in Monte Carlo simulation. It naturally leads to adaptive fitness in which the fitness function does not stay fixed but varies with the environment.
openaire +2 more sources
Genetic algorithms in feature and instance selection [PDF]
Feature selection and instance selection are two important data preprocessing steps in data mining, where the former is aimed at removing some irrelevant and/or redundant features from a given dataset and the latter at discarding the faulty data. Genetic algorithms have been widely used for these tasks in related studies.
Chih-Fong Tsai+2 more
openaire +1 more source