Sciweavers

2010 search results - page 45 / 402
» Feature Subset Selection Using a Genetic Algorithm
Sort
View
GECCO
2000
Springer
14 years 14 days ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
GECCO
2007
Springer
141views Optimization» more  GECCO 2007»
14 years 3 months ago
Evolving robust GP solutions for hedge fund stock selection in emerging markets
Abstract Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive)...
Wei Yan, Christopher D. Clack
IDA
2007
Springer
14 years 3 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 2 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
14 years 9 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo