期刊
INFORMATION PROCESSING LETTERS
卷 76, 期 4-6, 页码 175-181出版社
ELSEVIER
DOI: 10.1016/S0020-0190(00)00142-3
关键词
algorithms; clustering; minimum cut; graph connectivity; diameter
We have developed a novel algorithm for cluster analysis that is based on graph theoretic techniques. A similarity graph is defined and clusters in that graph correspond to highly connected subgraphs. A polynomial algorithm to compute them efficiently is presented. Our algorithm produces a solution with some provably good properties and performs well on simulated and real data. (C) 2000 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据