.png){kind=icon}
.png){kind=icon}
Return
Kernel alignment unsupervised discriminative dimensionality reduction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.03.127.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The performance of most existing adaptive graph learning methods, which adjust data similarity matrix according to the data representation, depends on the hypotheses that the data representation is a good indicator of the underlying data structure. However, this hypothesis is not always applicable when dealing with high dimensional data. In this paper, we propose a novel kernel alignment unsupervised discriminative dimensionality reduction (KaUDDR) algorithm. By integrating adaptive graph learning and feature learning into a joint learning framework, graph construction and dimensionality reduction are conducted simultaneously to guarantee the optimality of graph for feature learning in the proposed algorithm. Data kernel and similarity indicator kernel are defined by learned graph and the projected data in a low-dimensional subspace, a compact and discriminative data representation in the projected subspace is obtained by means of kernel alignment to explore the consistency between the projected data kernel and similarity indicator kernel. Experimental results on dimensionality reduction as well as clustering show that our method consistently outperforms the related unsupervised dimensionality reduction algorithm. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Kernel alignment
Adaptive graph-based method
Unsupervised dimensionality reduction
Graph Laplacian
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