Feature selection as a one-player game

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 359-366

  Gaudel, Romaric ^a   Sebag, Michèle ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; REINFORCEMENT LEARNING; TREES (MATHEMATICS);

BRANCHING FACTORS; MONTE-CARLO TREE SEARCHES; ONE PLAYER GAMES; PROOF OF CONCEPT; RELEVANT FEATURES; SELECTION POLICIES; UNBIASED ESTIMATES; UPPER CONFIDENCE TREES;

FEATURE EXTRACTION;

EID: 77956510446     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Alon, U., Barkai, N., Notterman, D. A., Gishdagger, K., Ybarradagger, S., Mackdagger, D. and Levine, A. J. Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. In Proc. of the Nat. Ac. of Sc. of the USA, pp. 6745-6750, June 1999.
2. Auer, P., Cesa-Bianchi, N. and Fischer, P. Finite-time analysis of the Multiarmed Bandit problem. Mach. Learn., 47(2-3):235-256, 2002.
3. Bach, F. Exploring large feature spaces with Hierarchical Multiple Kernel Learning. In NIPS'08, pp. 105-112, 2008.
4. Bellman, R. Dynamic Programming. Princeton Univ. Press, 1957.
5. Boullé, M. Compression-based averaging of selective Naive Bayes classifiers. J. Mach. Learn. Res., 8:1659-1685, 2007.
6. Breiman, L., Friedman, J., Stone, C. J. and Olshen, R.A. Classification and Regression Trees. Taylor & Francis, Inc., 1984.
7. Chan, A. B., Vasconcelos, N. and Lanckriet, G. R. G. Direct convex relaxations of sparse SVM. In ICML'01, pp. 145-153, 2007. (Pubitemid 47275060)
8. Collobert, R., Bengio, S. and Marithoz, J. Torch: A modular machine learning software library. Technical report, IDIAP, 2002.
9. Coulom, R. Efficient selectivity and backup operators in Monte-Carlo tree search. In Computers and Games, pp. 72-83, 2006.
10. de Mesmay, F., Rimmel, A., Voronenko, Y. and Püschel, M. Bandit-based optimization on graphs with application to library performance tuning. In ICML'09, pp. 729-736, 2009.
11. Efron, B., Hastie, T., Johnstone, I. and Tibshirani, R. Least angle regression. Annals of Statistics, 32:407-499, 2004.
12. Fung, G. and Mangasarian, O. L. Data Selection for Support Vector Machine Classifiers. In KDD'00, pp. 64-70, 2000.
13. Gelly, S. and Silver, D. Combining online and offline knowledge in UCT. In ICML'07, pp. 273-280, 2007.
14. Guyon, I., Weston, J., Barnhill, S. and Vapnik, V. Gene selection for cancer classification using Support Vector Machines. Mach. Learn., 46(1-3):389-422, 2002.
15. Guyon, I., Gunn, S. R., Ben-Hur, A. and Dror, G. Result analysis of the NIPS 2003 Feature Selection challenge. In NIPS'04, pp. 545-552, 2004.
16. Guyon, I., Li, J., Maxier, T., Pletscher, P. A., Schneider, G. and Uhr, M. Competitive baseline methods set new standards for the NIPS 2003 feature selection benchmark. Pattern Recogn. Lett, 28(12): 1438-1444, 2007.
17. Hall, M. A. Correlation-based Feature Selection for discrete and numeric class Machine Learning. In ICML '00, pp. 359-366, 2000.
18. Helleputte, T. and Dupont, P. Partially supervised Feature Selection with regularized linear models. In ICML'09, pp. 409-416, 2009.
19. Kira, K. and Rendeli, L. A. A practical approach to feature selection. In ML '92, pp. 249-256, 1992.
20. Kocsis, L. and Szepesvári, C. Bandit based Monte-Carlo planning. In ECML'06, pp. 282-293, 2006.
21. Margaritis, D. Toward provably correct Feature Selection in arbitrary domains. In NIPS'09, pp. 1240-1248, 2009.
22. Rogers, J. and Gunn, S. R. Identifying feature relevance using a Random Forest. In SLSFS, pp. 173-184, 2005.
23. Rolet, P., Sebag, M., and Teytaud, O. Boosting Active Learning to optimality: a tractable Monte-Carlo, Billiard-based algorithm. In ECML'09, pp. 302-317, 2009.
24. Shen, K. Q., Ong, C. J., Li, X. P. and Wilder-Smith, E. P. V. Feature selection via sensitivity analysis of SVM probabilistic outputs. Mach. Learn., 70(1): 1-20, 2008.
25. Tibshirani, R. Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society, Series B, 58:267-288, 1994.
26. Varrna, M. and Babu, B. R. More generality in efficient Multiple Kernel Learning. In ICML'09, pp. 1065-1072, 2009.
27. Wang, Y., Audibert, J.Y. and Munos, R. Algorithms for infinitely Many-Armed Bandits. In NIPS08, pp. 1729-1736, 2008.
28. Zhang, T. Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models. In NIPS'08, pp. 1921-1928, 2008a.
29. Zhang, T. Multi-stage Convex Relaxation for Learning with Sparse Regularization. In NIPS'08, pp. 1929-1936, 2008b.