A clustering algorithm based on graph connectivity
A clustering algorithm based on graph connectivity
复制标题
DOI：
10.1016/s0020-0190(00)00142-3
复制
发表时间：
2000-12-31
影响因子：
0.5
通讯作者：
Shamir, R
中科院分区：
文献类型：
--
作者：
Hartuv, E;Shamir, R
我们开发了一种基于图论技术的聚类分析新算法。定义相似性图，并且该图中的簇对应于高度连接的子图。提出了一种有效计算它们的多项式算法。我们的算法产生的解决方案具有一些可证明的良好特性，并且在模拟和真实数据上表现良好。 (C) 2000 Elsevier Science B.V. 保留所有权利。
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.