Adaptive Unsupervised Feature Selection With Structure Regularization
- 27 January 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (4) , 944-956
Abstract
Feature selection is one of the most important dimension reduction techniques for its efficiency and interpretation. Since practical data in large scale are usually collected without labels, and labeling these data are dramatically expensive and time-consuming, unsupervised feature selection has become a ubiquitous and challenging problem. Without label information, the fundamental problem of unsupervised feature selection lies in how to characterize the geometry structure of original feature space and produce a faithful feature subset, which preserves the intrinsic structure accurately. In this paper, we characterize the intrinsic local structure by an adaptive reconstruction graph and simultaneously consider its multiconnected-components (multicluster) structure by imposing a rank constraint on the corresponding Laplacian matrix. To achieve a desirable feature subset, we learn the optimal reconstruction graph and selective matrix simultaneously, instead of using a predetermined graph. We exploit an efficient alternative optimization algorithm to solve the proposed challenging problem, together with the theoretical analyses on its convergence and computational complexity. Finally, extensive experiments on clustering task are conducted over several benchmark data sets to verify the effectiveness and superiority of the proposed unsupervised feature selection algorithm.Keywords
Funding Information
- National Science Foundation of China (61502377, 61532015, 61532004)
- Data to Decisions Cooperative Research Centre
- National Key Research and Development Program of China (2016YFB1000903)
- China Post-Doctoral Science Foundation (2015M582662)
This publication has 45 references indexed in Scilit:
- Clustering-Guided Sparse Structural Learning for Unsupervised Feature SelectionIEEE Transactions on Knowledge and Data Engineering, 2013
- FSMRank: Feature Selection Algorithm for Learning to RankIEEE Transactions on Neural Networks and Learning Systems, 2013
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraintsComputational Optimization and Applications, 2011
- Variable Selection for Clustering with Gaussian Mixture ModelsBiometrics, 2009
- A wrapper method for feature selection using Support Vector MachinesInformation Sciences, 2009
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- Selection of relevant features and examples in machine learningArtificial Intelligence, 1997
- 35 Use of distance measures, information measures and error bounds in feature evaluation1982