Adaptive Hypergraph Learning for Unsupervised Feature Selection

Adaptive Hypergraph Learning for Unsupervised Feature Selection

Xiaofeng Zhu, Yonghua Zhu, Shichao Zhang, Rongyao Hu, Wei He

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Main track. Pages 3581-3587. https://doi.org/10.24963/ijcai.2017/501

Current unsupervised feature selection (UFS) methods learn the similarity matrix by using a simple graph which is learnt from the original data as well as is independent from the process of feature selection, and thus unable to efficiently remove the redundant/irrelevant features. To address these issues, we propose a new UFS method to jointly learn the similarity matrix and conduct both subspace learning (via learning a dynamic hypergraph) and feature selection (via a sparsity constraint). As a result, we reduce the feature dimensions using different methods (i.e., subspace learning and feature selection) from different feature spaces, and thus makes our method select the informative features effectively and robustly. We tested our method using benchmark datasets to conduct the clustering tasks using the selected features, and the experimental results show that our proposed method outperforms all the comparison methods.
Keywords:
Machine Learning: Feature Selection/Construction
Machine Learning: Machine Learning
Machine Learning: Unsupervised Learning