Sciweavers

3422 search results - page 15 / 685
» Random Subset Optimization
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
14 years 11 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
BMCBI
2010
111views more  BMCBI 2010»
14 years 12 months ago
Functional Analysis: Evaluation of Response Intensities - Tailoring ANOVA for Lists of Expression Subsets
Background: Microarray data is frequently used to characterize the expression profile of a whole genome and to compare the characteristics of that genome under several conditions....
Fabrice Berger, Bertrand De Meulder, Anthoula Gaig...
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
15 years 5 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...
ROBIO
2006
IEEE
153views Robotics» more  ROBIO 2006»
15 years 5 months ago
GA-based Feature Subset Selection for Myoelectric Classification
– This paper presents an ongoing investigation to select optimal subset of features from set of well-known myoelectric signals (MES) features in time and frequency domains. Four ...
Mohammadreza Asghari Oskoei, Huosheng Hu
ICPR
2010
IEEE
14 years 12 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