Abstract
A new hierarchical clustering method for point sets is presented, called diameter clustering, whose clusters belong to most other natural clusterings. For each cluster it holds that its diameter is small compared to the distance to a nearest point outside the cluster. Given a Euclidean minimum spanning tree of the input point set, it is shown that the diameter clustering can be computed in linear time. In addition we derive a nice property of this hierarchy which makes it particularly useful as a building block. It is shown in this paper that it can be employed to obtain a good approximation for the known single linkage clustering in roughly linear time. Other examples of its usefulness include computing the greedy triangulation, the complete linkage hierarchy, and a data structure for faster range queries.
This paper was partially supported by TFR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Aurenhammer. Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345–405, 1991.
A. D. Gordon. Classification. Chapman and Hall, 1981.
J. C. Gover and G. J. S. Ross. Minimum spanning trees and single linkage-linkage cluster analysis. Applied Statistics, 18:54–64, 1969.
J. A. Hartigan. Clustering algorithms. Wiley, New York, 1975.
A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice-Hall, New Jersey, 1988.
D. Kirkpatrick and S. Reisch. Upper bounds for sorting integers on random access machines. Theoretical Computer Science, 28:263–276, 1984.
D. Krznaric and C. Levcopoulos. Computing a threaded quadtree (with links between neighbors) from the delaunay triangulation in linear time. In 7th Canadian Conference on Computational Geometry, pages 187–192, 1995.
D. Krznaric and C. Levcopoulos. The first subquadratic algorithm for complete linkage clustering. In 6th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science. Springer-Verlag, 1995. To appear.
C. Levcopoulos and D. Krznaric. The greedy triangulation can be computed from the delaunay in linear time. Technical Report LU-CS-TR:94-136, Department of Computer Science, Lund University, Lund, Sweden, 1994.
F. P. Preparata and M. I. Shamos. Computational geometry: an introduction. Springer-Verlag, New York, 1985.
G. Robins and J. S. Salowe. Low-degree minimum spanning trees. Discrete & Computational Geometry, 14(2):151–165, 1995.
R. E. Tarjan. Efficiency of a good but not linear disjoint set union algorithm. Journal of the ACM, 22(2):215–225, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krznaric, D., Levcopoulos, C. (1995). Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time. In: Thiagarajan, P.S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1995. Lecture Notes in Computer Science, vol 1026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60692-0_66
Download citation
DOI: https://doi.org/10.1007/3-540-60692-0_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60692-5
Online ISBN: 978-3-540-49263-4
eBook Packages: Springer Book Archive