arrow
Return

Clustering structure identification with ordering graph

delete2026-04-15
delete0
PRE
AI
Z
Zheng Xing *
赵伟兵 cover
赵伟兵 (Weibing Zhao)
DOI:10.1016/j.knosys.2026.115999delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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
Knowledge-Based Systems
IF:
7.6
Papers:
1.2W
Citations:
4.5W

Organization

No organization information available