Skip to content
RDL
Network
Ekosistem
Uygulama değiştir
EN
Hakkımızda
SSS
Giriş yap
Başla
Efficient spectral embedding representation approximation for large-scale data clustering — Jie Zhou (2025) | RDL Network
Back
Cite
Save
Save for later
Share
Home
Publications
Efficient spectral embedding representation approximation for large-scale data clustering
Shared by
Witold Pedrycz
University of Alberta
Efficient spectral embedding representation approximation for large-scale data clustering
Article
2025
en
Authors
+2 more
JZ
Jie Zhou
XZ
Xin‐Xiang Zhang
CG
Can Gao
Discussion
(0)
Sign in
to like and join the discussion.
No comments yet. Be the first to comment.
Related publications
Preprint
2013
An Out-of-sample Extension of Sparse Subspace Clustering and Low Rank Representation for Clustering Large Scale Data Sets.
Xi Peng
,
Lei Zhang
,
Yi Zhang
Article
2019
Scalable Spectral Clustering for Overlapping Community Detection in Large-Scale Networks
Hadrien Van Lierde
,
Tommy W. S. Chow
,
Guanrong Chen
IEEE Transactions on Knowledge and Data Engineering
Article
2025
Spectral Embedding Representation Based on Random Anchor Graph Aggregation
Jie Zhou
,
Fengkai Li
,
Can Gao
,
Weiping Ding
,
Witold Pedrycz
,
Guangming Lang
Article
2009
Representation and classification of high-dimensional biomedical spectral data
Witold Pedrycz
,
Dong‐Chang Lee
,
Nick J. Pizzi
Article
2018
Simplex Representation for Subspace Clustering.
Jun Xu
,
Deyu Meng
,
Lei Zhang
Discussion(0)
No comments yet. Be the first to comment.