Return
Clustering structure identification with ordering graph
DOI:10.1016/j.knosys.2026.115999.png)
Abstract
En 中文
• We block-diagonalize similarity matrices using inherent data clustering. • We develop a greedy algorithm to identify diagonal blocks for precise clustering. • We prove the optimality of our partition algorithm for reliable clustering.
Keywords:
Clustering
Block-diagonalization
Greedy algorithm
Similarity matrices
Ordering graph
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
Organization
No organization information available

