Early stopping for mutual information based feature selection

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2012, Pages 975-978

  Beinrucker, Andre ^a   Dogan, Urun ^a   Blanchard, Gilles ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TIME; EARLY STOPPING; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL IMAGES; MUTUAL INFORMATIONS; PRACTICAL USE; PREDICTIVE PERFORMANCE;

SOFTWARE ENGINEERING;

PATTERN RECOGNITION;

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

References (9)

1. Mash project (massive sets of heuristics). http://mash-project.eu/.
2. G. Brown, A. Pocock, M. Zhao, and M. Luján. Conditional likelihood maximisation: A unifying framework for information theoretic feature selection. Journal of Machine Learning Research, 13(1):26-66, 2012.
3. T. Cover, J. Thomas, et al. Elements of information theory, volume 6. Wiley Online Library, 1991.
4. F. Fleuret. Fast binary feature selection with conditional mutual information. JMLR, 5:1531-1555, 2004.
5. I. Guyon. Feature extraction: foundations and applications, volume 207. Springer Verlag, 2006.
6. A. Krizhevsky and G. Hinton. Learning multiple layers of features from tiny images. Master's thesis, Department of Computer Science, University of Toronto, 2009.
7. Y. LeCun and C. Cortes. The mnist database of handwritten digits, 1998.
8. L. Paninski. Estimation of entropy and mutual information. Neural Computation, 15(6):1191-1253, 2003.
9. R. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine learning, 37(3):297-336, 1999.