返回
Adaptive semi-supervised dimensionality reduction with sparse representation using pairwise constraints
DOI:10.1016/j.neucom.2015.11.048.png)
摘要
En 中文
With the rapid accumulation of high dimensional data, dimensionality reduction plays a more and more important role in practical data processing and learning tasks. This paper studies semi-supervised dimensionality reduction using pairwise constraints. In this setting, domain knowledge is given in the form of pairwise constraints, which specifies whether a pair of instances belong to the same class (must link constraint) or different classes (cannot-link constraint). In this paper, a novel semi-supervised dimensionality reduction method called Adaptive Semi-Supervised Dimensionality Reduction with Sparse Representation (ASSDR-SR) is proposed, which can get the optimized low dimensional representation of the original data by adaptively adjusting the weights of the pairwise constraints and simultaneously optimizing the graph construction using the l(1) graph of sparse representation. Experiments on clustering and classification tasks show that ASSDR-SR is superior to some existing dimensionality reduction methods. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Semi-supervised learning
Dimensionality reduction
Pairwise constraints
Sparse representation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Semi-supervised dimensionality reduction for analyzing high-dimensional data with constraints
NEUROCOMPUTING
IF6.5
Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
PATTERN RECOGNITION
IF7.6
Integrating local and global topological structures for semi-supervised dimensionality reduction
SOFT COMPUTING
IF2.5

