.png){kind=icon}
Return
Unsupervised feature analysis with sparse adaptive learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2017.12.022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Unsupervised feature learning has played an important role in machine learning due to its ability to save human labor cost. Since the absence of labels in such scenario, a commonly used approach is to select features according to the similarity matrix derived from the original feature space. However, their similarity matrices suffer from noises and redundant features, with which are frequently confronted in high-dimensional data. In this paper, we propose a novel unsupervised feature selection algorithm. Compared with the previous works, there are mainly two merits of the proposed algorithm: (1) The similarity matrix is adaptively adjusted with a comprehensive strategy to fully utilize the information in the projected data and the original data. (2) To guarantee the clarity of the dramatically learned manifold structure, a non-squared l(2)-norm based sparsity method is imposed into the objective function. The proposed objective function involves several non-smooth constraints, making it difficult to solve. We also design an efficient iterative algorithm to optimize it. Experimental results demonstrate the effectiveness of our algorithm compared with the state-of-the-art algorithms on several kinds of publicly available datasets. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Unsupervised learning
Feature selection
Adaptive structure learning
l(2)-Norm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
Web and Personal Image Annotation by Mining Label Correlation With Relaxed Visual Graph Embedding
PREAI
ShareSaveShareSave
View more