.png){kind=icon}
.png){kind=icon}
Return
Adaptive semi-supervised dimensionality reduction with sparse representation using pairwise constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.11.048.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Semi-supervised learning
Dimensionality reduction
Pairwise constraints
Sparse representation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W