Toward provably correct feature selection in arbitrary domains

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 1240-1248

  Margaritis, Dimitris ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE SELECTION;

ARBITRARY PROBABILITY DISTRIBUTION; BOUNDARY THEOREM; FEATURES SELECTION; LEARN+; MARKOV BOUNDARY; MULTIPLE FEATURES; OPTIMAL SOLUTIONS; PROBABILITY: DISTRIBUTIONS; PROPERTY; SETS OF FEATURES;

PROBABILITY DISTRIBUTIONS;

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

References (18)

1. Isabelle Guyon and André Elisseeff. An introduction to variable and feature selection. Journal of Machine Learning Research, 3:1157-1182, 2003.
2. Daphne Koller and Mehran Sahami. Toward optimal feature selection. In Proceedings of the Tenth International Conference on Machine Learning (ICML), pages 284-292, 1996.
3. P. M. Narendra and K. Fukunaga. A branch and bound algorithm for feature subset selection. IEEE Transactions on Computers, C-26(9):917-922, 1977.
4. H. Almuallim and T. G. Dietterich. Learning with many irrelevant features. In Proceedings of the National Conference on the Americal Association for Artifical Intelligence (AAAI), 1991.
5. K. Kira and L. A. Rendell. The feature selection problem: Traditional methods and a new algorithm. In Proceedings of the National Conference on the Americal Association for Artifical Intelligence (AAAI), pages 129-134, 1992.
6. M. Dash and H. Liu. Feature selection for classification. Intelligent Data Analysis, 1(3): 131-156, 1997.
7. Huan Liu and Hiroshi Motoda, editors. Feature Extraction, Construction and Selection: A Data Mining Perspective, volume 453 of The Springer International Series in Engineering and Computer Science. 1998.
8. Avrim Blum and Pat Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2):245-271, 1997.
9. R. Kohavi and G. H. John. Wrappers for feature subset selection. Artificial Intelligence, 97 (1-2):273-324, 1997.
10. Dimitris Margaritis and Sebastian Thrun. Bayesian network induction via local neighborhoods. In Advances in Neural Information Processing Systems 12 (NIPS), 2000.
11. I. Tsamardinos, C. Aliferis, and A. Statnikov. Algorithms for large scale Markov blanket discovery. In Proceedings of the 16th International FLAIRS Conference, 2003.
12. I. Tsamardinos, C. Aliferis, and A. Statnikov. Time and sample efficient discovery of Markov blankets and direct causal relations. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 673-678, 2003.
13. N. Meinshausen and P. Bühlmann. High-dimensional graphs and variable selection with the Lasso. Annals of Statistics, 34:1436-1462, 2006.
14. Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. 1988.
15. Michael Kearns and Umesh V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
16. A. Agresti. Categorical Data Analysis. John Wiley and Sons, 1990.
17. M. Kearns. Efficient noise-tolerant learning from statistical queries. J. ACM, 45(6):983-1006, 1998.
18. C. J. van Rijsbergen. Information Retrieval. Butterworth-Heinemann, London, 1979.