Sciweavers

Share
ICML
2009
IEEE

Non-monotonic feature selection

11 years 5 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinatorial optimization problem, and is usually solved by an approximation. Conventional feature selection methods address the computational challenge in two steps: (a) ranking all the features by certain scores that are usually computed independently from the number of specified features m, and (b) selecting the top m ranked features. One major shortcoming of these approaches is that if a feature f is chosen when the number of specified features is m, it will always be chosen when the number of specified features is larger than m. We refer to this property as the “monotonic” property of feature selection. In this work, we argue that it is important to develop efficient algorithms for non-monotonic feature selection. To this end, we develop an algorithm for non-monotonic feature selection that approximates t...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu,
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where ICML
Authors Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, Irwin King
Comments (0)
books