Adaptive Hypergraph Learning for Unsupervised Feature Selection
release_xha7r2f3erbapairz3qyllgyki
by
Xiaofeng Zhu, Yonghua Zhu, Shichao Zhang, Rongyao Hu, Wei He
2017 p3581-3587
Abstract
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.
In application/xml+jats
format
Archived Files and Locations
application/pdf 232.4 kB
file_vbsx3aofzzefzny6fwdteij7ny
|
web.archive.org (webarchive) www.ijcai.org (web) |
paper-conference
Stage
published
Year 2017
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar