.png){kind=icon}
返回
Unsupervised feature analysis with sparse adaptive learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2017.12.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Unsupervised learning
Feature selection
Adaptive structure learning
l(2)-Norm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
Web and Personal Image Annotation by Mining Label Correlation With Relaxed Visual Graph Embedding
PREAI
分享收藏Planar gradiometer for magnetic induction tomography (MIT): theoretical and experimental sensitivity maps for a low-contrast phantom用于磁感应断层扫描 (MIT) 的平面梯度仪: 低对比度体模的理论和实验灵敏度图
PREAI
分享收藏
查看更多内容