An improved algorithm for hierarchical clustering using strong components |
| |
| Authors: | Robert E Tarjan |
| |
| Affiliation: | Bell Laboratories, Murray Hill, NJ 07974, U.S.A. |
| |
| Abstract: | In 1982 the author presented an O(m(log n)2) time algorithm for hierarchically decomposing a directed n-vertex, m-edge graph with weighted edges into strong components. Such an algorithm is useful in cluster analysis of data with an asymmetric similarity measure. The present paper gives a simpler algorithm with the faster running time of O(m log n). |
| |
| Keywords: | Cluster analysis divide-and-conquer graph algorithm hierarchical decomposition strong components |
| 本文献已被 ScienceDirect 等数据库收录！ |
