Scalable and Flexible Unsupervised Feature Selection.


Journal

Neural computation
ISSN: 1530-888X
Titre abrégé: Neural Comput
Pays: United States
ID NLM: 9426182

Informations de publication

Date de publication:
Mar 2019
Historique:
pubmed: 16 1 2019
medline: 16 1 2019
entrez: 16 1 2019
Statut: ppublish

Résumé

Recently, graph-based unsupervised feature selection algorithms (GUFS) have been shown to efficiently handle prevalent high-dimensional unlabeled data. One common drawback associated with existing graph-based approaches is that they tend to be time-consuming and in need of large storage, especially when faced with the increasing size of data. Research has started using anchors to accelerate graph-based learning model for feature selection, while the hard linear constraint between the data matrix and the lower-dimensional representation is usually overstrict in many applications. In this letter, we propose a flexible linearization model with anchor graph and

Identifiants

pubmed: 30645178
doi: 10.1162/neco_a_01163
doi:

Types de publication

Journal Article Research Support, Non-U.S. Gov't

Langues

eng

Pagination

517-537

Auteurs

Haojie Hu (H)

Xi'an Research Institute of Hi-Tech, Xi'an 710025, China haojiehu705@gmail.com.

Rong Wang (R)

Center for Optical Imagery Analysis and Learning, Northwestern Polytechnical University, Xi'an 710072, China wangrong07@tsinghua.org.cn.

Xiaojun Yang (X)

School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, China yangxj18@gdut.edu.cn.

Feiping Nie (F)

Center for Optical Imagery Analysis and Learning, Northwestern Polytechnical University, Xi'an 710072, China feipingnie@gmail.com.

Classifications MeSH