Efficient Spectral Feature Selection with Minimum Redundancy

Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Volumn , Issue , 2010, Pages 673-678

  Zhao, Zheng ^a   Wang, Lei ^b   Liu, Huan ^a  

^a Arizona State University   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE SELECTION;

ADVERSE EFFECT; FEATURE SELECTION ALGORITHM; FEATURES SELECTION; LEARNING PERFORMANCE; REAL-WORLD; REDUNDANT FEATURES; RELEVANT FEATURES; SAMPLE SIMILARITIES; SPECTRAL FEATURE; UNSUPERVISED FEATURE SELECTION;

REDUNDANCY;

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

References (25)

1. Appice, A.; Ceci, M.; and et al. 2004. Redundant feature elimination for multi-class problems. In ICML.
2. Argyriou, A.; Evgeniou, T.; and Pontil, M. 2008. Convex multi-task feature learning. Mach. Learning 73:243-272.
3. Boyd, S., and Vandenberghe, L. 2004. Convex Optimization. Cambridge University Press.
4. Ding, C., and Peng, H. 2003. Minimum redundancy feature selection from microarray gene expression data. In CSB'03, 523-529.
5. Duangsoithong, R. 2009. Relevant and redundant feature analysis with ensemble classification. In ICAPR'09.
6. Duda, R.; Hart, P.; and Stork, D. 2001. Pattern Classification. John Wiley & Sons, New York, 2 edition.
7. Gabrilovich, E., and et al. 2004. Text categorization with many redundant features: using aggressive feature selection to make svms competitive with c4.5. In ICML'04.
8. Guyon, I., and Elisseeff, A. 2003. An introduction to variable and feature selection. JMLR 3:1157-1182.
9. Hall, M. 1999. Correlation Based Feature Selection for Machine Learning. Ph.D. Dissertation, University of Waikato, Dept. of Computer Science.
10. Hastie, T.; Tibshirani, R.; and Friedman, J. 2001. The Elements of Statistical Learning. Springer.
11. He, X.; Cai, D.; and Niyogi, P. 2005. Laplacian score for feature selection. In NIPS.
12. Kearns, M., and Vazirani, U. 1994. An Introduction to Computational Learning Theory. The MIT Press.
13. Liu, H., and Motoda, H. 1998. Feature Selection for Knowledge Discovery and Data Mining. Boston: Kluwer Academic Publishers.
14. Liu, J.; Ji, S.; and Ye, J. 2009. Multi-task feature learning via efficient l2, 1-norm minimization. In UAI'09.
15. Nie, F.; Xiang, S.; Jia, Y.; Zhang, C.; and Yan, S. 2008. Trace ratio criterion for feature selection. In AAAI.
16. Obozinski, G.; Wainwright, M. J.; and Jordan, M. I. 2008. Highdimensional union support recovery in multivariate regression. In Neural Information Processing Systems.
17. Seeger, M. 2008. Bayesian inference and optimal design for the sparse linear model. JMLR 9:759-813.
18. Sikonja, M. R., and Kononenko, I. 2003. Theoretical and empirical analysis of Relief and ReliefF. Machine Learning 53:23-69.
19. Song, L.; Smola, A.; Gretton, A.; Borgwardt, K.; and Bedo, J. 2007. Supervised feature selection via dependence estimation. In ICML.
20. Sun, L.; Ji, S.; and Ye, J. 2009. A least squares formulation for a class of generalized eigenvalue problems in machine learning. In ICML.
21. Suykens, J., and Vandewalle, J. 1999. Least squares support vector machine classifiers. Neural Processing Letters 9(3):1370-4621.
22. von Luxburg, U. 2007. A tutorial on spectral clustering. Tech. report, Max Planck Inst. for Biological Cybernetics.
23. Weston, J.; Elisseff, A.; Schoelkopf, B.; and Tipping, M. 2003. Use of the zero norm with linear models and kernel methods. JMLR 3:1439-1461.
24. Yu, L., and Liu, H. 2004. Efficient feature selection via analysis of relevance and redundancy. JMLR 5:1205-1224.
25. Zhao, Z., and Liu, H. 2007. Spectral feature selection for supervised and unsupervised learning. In ICML.