arrow
Return

Efficient spectral embedding representation approximation for large-scale data clustering

delete2025-11-09
delete0
PRE
AI
周杰 cover
周杰 (Jie Zhou)
X
Xin‐Xiang Zhang
C
Can Gao
赖志慧 (Zhihui Lai)
W
Witold Pedrycz
DOI:10.1016/j.patcog.2025.112693delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• An efficient approximate spectral embedding representation (ASER) method for large-scale data is presented. • The spectral embedding representations of the anchors are directly used to approximate those of the original samples. • ASER conducts spectral representation approximation in the embedding space instead of approximating the similarity matrix. • Extensive experimental results on several datasets show the effectiveness of ASER.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

C
changsha university of science and technology
Scholars:
3.0K
Papers: 1.1K
Citations: 0
U
university of alberta
Scholars:
5.1W
Papers: 4.9W
Citations: 65
S
shenzhen university
Scholars:
4.5W
Papers: 3.4W
Citations: 72
researcher View more organizations