nips nips2004 nips2004-156 nips2004-156-reference knowledge-graph by maker-knowledge-mining

156 nips-2004-Result Analysis of the NIPS 2003 Feature Selection Challenge


Source: pdf

Author: Isabelle Guyon, Steve Gunn, Asa Ben-Hur, Gideon Dror

Abstract: The NIPS 2003 workshops included a feature selection competition organized by the authors. We provided participants with five datasets from different application domains and called for classification results using a minimal number of features. The competition took place over a period of 13 weeks and attracted 78 research groups. Participants were asked to make on-line submissions on the validation and test sets, with performance on the validation set being presented immediately to the participant and performance on the test set presented to the participants at the workshop. In total 1863 entries were made on the validation sets during the development period and 135 entries on all test sets for the final competition. The winners used a combination of Bayesian neural networks with ARD priors and Dirichlet diffusion trees. Other top entries used a variety of methods for feature selection, which combined filters and/or wrapper or embedded methods using Random Forests, kernel methods, or neural networks as a classification engine. The results of the benchmark (including the predictions made by the participants and the features they selected) and the scoring software are publicly available. The benchmark is available at www.nipsfsc.ecs.soton.ac.uk for post-challenge submissions to stimulate further research. 1


reference text

[1] A. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2):245–271, December 1997.

[2] Leo Breiman. Bagging predictors. Machine Learning, 24(2):123–140, 1996.

[3] Leo Breiman. Random forests. Machine Learning, 45(1):5–32, 2001.

[4] S. Kremer, et al. NIPS 2000 unlabeled data competition. http://q.cis.uoguelph.ca/~skremer/Research/NIPS2000/, 2000.

[5] S. Kremer, et al. NIPS 2001 unlabeled data competition. http://q.cis.uoguelph.ca/~skremer/Research/NIPS2001/, 2001.

[6] I. Guyon. Design of experiments of the NIPS 2003 variable selection benchmark. http://www.nipsfsc.ecs.soton.ac.uk/papers/Datasets.pdf, 2003.

[7] I. Guyon and A. Elisseeff. An introduction to variable and feature selection. JMLR, 3:1157–1182, March 2003.

[8] I. Guyon and S. Gunn. Model selection and ensemble methods challenge in preparation http://clopinet.com/isabelle/projects/modelselect.

[9] I. Guyon, S. Gunn, M. Nikravesh, and L. Zadeh, Editors. Feature Extraction, Foundations and Applications. Springer-Verlag, http://clopinet.com/isabelle/Projects/NIPS2003/call-for-papers.html, In preparation. See also on-line supplementary material: http://clopinet.com/isabelle/Projects/NIPS2003/analysis.html.

[10] D. Kazakov, L. Popelinsky, and O. Stepankova. MLnet machine learning network on-line information service. In http://www.mlnet.org.

[11] R. Kohavi and G. John. Wrappers for feature selection. Artificial Intelligence, 97(1-2):273–324, December 1997.

[12] D. LaLoudouana and M. Bonouliqui Tarare. Data set selection. In NIPS02 http://www.jmlg.org/papers/laloudouana03.pdf, 2002.

[13] P. M. Murphy and D. W. Aha. UCI repository of machine learning databases. In http://www.ics.uci.edu/~mlearn/MLRepository.html, 1994.

[14] R. M. Neal. Bayesian Learning for Neural Networks. Number 118 in Lecture Notes in Statistics. Springer-Verlag, New York, 1996.

[15] R. M. Neal. Defining priors for distributions using dirichlet diffusion trees. Technical Report 0104, Dept. of Statistics, University of Toronto, March 2001.

[16] B. Schoelkopf and A. Smola. Learning with Kernels – Support Vector Machines, Regularization, Optimization and Beyond. MIT Press, Cambridge MA, 2002.

[17] V. Vapnik. Statistical Learning Theory. John Wiley & Sons, N.Y., 1998.