Efficient semi-supervised feature selection: Constraint, relevance, and redundancy

IEEE Transactions on Knowledge and Data Engineering

Volumn 26, Issue 5, 2014, Pages 1131-1143

  Benabdeslem, Khalid ^a   Hindawi, Mohammed ^b  

^a UNIVERSITÉ LYON 1   (France)

^b CNRS   (France)

Author keywords

constraints; redundancy; relevance; Semi supervised feature selection

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

CONSTRAINTS; EFFICIENT FEATURE SELECTIONS; FEATURE SELECTION METHODS; HIGH DIMENSIONAL DATA; PAIRWISE CONSTRAINTS; RELEVANCE; SECOND PROCEDURES; SEMI-SUPERVISED;

REDUNDANCY;

EID: 84901006505     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2013.86     Document Type: Article

References (43)

1. Z. Zhao and H. Liu, Spectral Feature Selection for Data Mining (Data Mining and Knowledge Discovery Series). Boca Raton, FL, USA: Chapman and Hall-CRC, 2012.
2. R. Fisher, "The use of multiple measurements in taxonomic problems," Ann. Eugen, vol. 7, no. 2, pp. 179-188, Sept. 1936.
3. I. Jolliffe, Principal Component Analysis. New York, NY, USA: Springer, 2002.
4. S. T. Roweis and L. K. Saul, "Nonlinear dimensionality reduction by local linear embedding," Science, vol. 290, no. 5500, pp. 2323-2326, Dec. 2000. (Pubitemid 32041578)
5. B. Scholkopf, A. Smola, and K. R. Muller, "Nonlinear component analysis as a Kernel Eigenvalue problem," Neural Comput., vol. 10, no. 5, pp. 1299-1319, 1998. (Pubitemid 128463674)
6. X. He and P. Niyogi, "Locality preserving projections," in Proc. NIPS, 2004.
7. M. Belkin and P. Niyogi, "Laplacian eigenmaps and spectral techniques for embedding and clustering," in Proc. NIPS, 2002.
8. I. Guyon and A. Elisseeff, "An introduction to variable and feature selection," J. Mach. Learn. Res., vol. 3, pp. 1157-1182, Mar. 2003.
9. J. G. Dy and C. E. Brodley, "Feature selection for unsupervised learning," J. Mach. Learn. Res., vol. 5, pp. 845-889, Aug. 2004.
10. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification. New York, NY, USA: Wiley Interscience, 2000.
11. M. Robnik-Sikonja and I. Kononenko, "Theoretical and empirical analysis of relief and relieff," Mach. Learn., vol. 53, no. 1-2, pp. 23-69, 2003.
12. L. Yu and H. Liu, "Efficient feature selection via analysis of relevance and redundancy," J. Mach. Learn. Res., vol. 5, pp. 1205-1224, Oct. 2004.
13. Z. Zhao and H. Liu, "Spectral feature selection for supervised and unsupervised learning," in Proc. 24th Int. Conf. Mach. Learn., Corvallis, OR, USA, 2007.
14. C. M. Bishop, Neural Networks for Pattern Recognition. New York, NY, USA: Oxford University Press, 1995.
15. X. He, D. Cai, and P. Niyogi, "Laplacian score for feature selection," in Proc. NIPS, Vancouver, BC, Canada, 2005.
16. L. Song, A. Smola, A. Gretton, J. Bedo, and K. Borgwardt, "Feature selection via dependence maximization," J. Mach. Learn. Res., vol. 13, no. 1, pp. 1393-1434, Jan. 2012.
17. Z. Zhao and H. Liu, "Semi-supervised feature selection via spectral analysis," in Proc. SIAM Int. Conf. Data Mining, Tempe, AZ, USA, 2007, pp. 641-646.
18. A. Bar-Hillel, T. Hertz, N. Shental, and D. Weinshall, "Learning a Mahalanobis metric from equivalence constraints," J. Mach. Learn. Res., vol. 6, pp. 937-965, Jan. 2005.
19. D. Zhang, Z. Zhou, and S. Chen, "Semi-supervised dimensionality reduction," in Proc. SIAM Int. Conf. Data Mining, Pittsburgh, PA, USA, 2007.
20. D. Zhang, S. Chen, and Z. Zhou, "Constraint score: A new filter method for feature selection with pairwise constraints," Pattern Recognit., vol. 41, no. 5, pp. 1440-1451, 2008.
21. M. Kalakech, P. Biela, L. Macaire, and D. Hamad, "Constraint scores for semi-supervised feature selection: A comparative study," Pattern Recognit. Lett., vol. 32, no. 5, pp. 656-665, 2011.
22. K. Benabdeslem and M. Hindawi, "Constrained Laplacian score for semi-supervised feature selection," in Proc. ECML-PKDD, Athens, Greece, 2011, pp. 204-218.
23. I. Davidson, K. Wagstaff, and S. Basu, "Measuring constraintset utility for partitional clustering algorithms," in Proc. ECML/PKDD, 2006.
24. K. Allab and K. Benabdeslem, "Constraint selection for semisupervised topological clustering," in Proc. ECML-PKDD, Athens, Greece, 2011, pp. 28-43.
25. Z. Zhao, L. Wang, and H. Liu, "Efficient spectral feature selection with minimum redundancy," in Proc. AAAI, 2010.
26. C. Ding and H. C. Peng, "Minimum redundancy feature selection from microarray gene expression data," in Proc. IEEE CSB, 2003, pp. 523-528.
27. H. Peng, F. Long, and C. Ding, "Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 8, pp. 1226-1238, Aug. 2005. (Pubitemid 41245053)
28. B. Auffarth, M. Lopez, and J. Cerquides, "Comparison of redundancy and relevance measures for feature selection in tissue classification of CT images," in Proc. 10th ICDM, Berlin, Germany, 2010, pp. 248-262.
29. J. Weston, A. Elisseff, B. Schoelkopf, and M. Tipping, "Use the zero norm with linear models and kernel methods," J. Mach. Learn. Res., vol. 3, pp. 1439-1461, Mar. 2003.
30. Z. Zhao, L. Wang, H. Liu, and J. Ye, "On similarity preserving feature selection," IEEE Trans. Knowl. Data Eng., vol. 25, no. 3, pp. 619-632, Mar. 2013.
31. F. Chung, Spectral Graph Theory. Providence, RI, USA: American Mathematical SoCiety, 1997.
32. M. Hindawi, K. Allab, and K. Benabdeslem, "Constraint selection based semi-supervised feature selection," in Proc. IEEE ICDM, Vancouver, BC, Canada, 2011, pp. 1080-1085.
33. T. Kohonen, Self OrGaNizing Map. Berlin, Germany: Springer Verlag, 2001.
34. J. B. MacQueen, "Some methods for classification and analysis of multivariate observations," in Proc. 5th Symp. Math. Statist. Probab., Berkley, CA, USA, 1967, pp. 281-297.
35. J. H. Ward, "Hierarchical grouping to optimize an objective function," J. Amer. Statist. AsSoC., vol. 58, no. 301, pp. 236-244, 1963.
36. M. Kalyani and M. Sushmita, "Clustering and its validation in a symbolic framework," Pattern Recognit. Lett., vol. 24, no. 14, pp. 2367-2376, 2003.
37. X. He, D. Cai, S. Yan, and H. Jiang Zhang, "Neighborhood preserving embedding," in Proc. 10th IEEE Int. Conf. Comput. Vision, Beijing, Germany, 2005, pp. 1208-1213. (Pubitemid 44042318)
38. E. Elhamifar and R. Vidal, "Sparse manifold clustering and embedding," in Proc. NIPS, 2011, pp. 55-63.
39. S. Kullback, Information Theory and Statistics (Wiley Series in Probability and Mathematical Statistics). New York, NY, USA: Wiley, 1959.
40. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms. Cambridge, MA, USA: McGraw-Hill Higher Education, 2001.
41. A. Frank and A. Asuncion. (2010). UCIMachine Learning Repository [Online]. Available: http://archive.ics.uci.edu/ml
42. C. C. Chang and C. J. Lin, "LIBSVM: A library for support vector machines," ACM Trans. Intell. Syst. Technol., vol. 2, pp. 27:1-27:27, 2011 [Online]. Available: http://www.csie.ntu.edu.tw/~cjlin/libsvm
43. W. M. Rand, "Objective criteria for the evaluation of clustering method," J. Amer. Statist. AsSoC., vol. 66, no. 336, pp. 846-850, Dec. 1971.