.png){kind=icon}
.png){kind=icon}
Return
Simultaneous Spectral Data Embedding and Clustering
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2018.2815623.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Spectral clustering is often carried out by combining spectral data embedding and k-means clustering. However, the aims, dimensionality reduction and clustering, are usually not performed jointly. In this brief, we propose a novel approach to finding an optimal spectral embedding for identifying a partition of the set of objects; it iteratively alternates spectral embedding and clustering. In doing so, we show that our model can learn a low-dimensional representation more suited to clustering. Compared with classical spectral clustering methods, the proposed algorithm is not costly and outperforms not only these methods but also other nonnegative matrix factorization variants.
Keywords:
Dimensionality reduction (DR)
spectral clustering
spectral embedding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W