Sciweavers

15485 search results - page 3 / 3097
» Computing Optimal Subsets
Sort
View
ICPR
2010
IEEE
13 years 5 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
13 years 11 months ago
Hierarchical genetic programming based on test input subsets
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
David Jackson
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 5 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
13 years 11 months ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...
COCOON
2007
Springer
13 years 11 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin