Fast algorithms for complete linkage clustering

Discrete and Computational Geometry

Volumn 19, Issue 1, 1998, Pages 131-145

  Krznaric, D ^a   Levcopoulos, C ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032351464     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009332     Document Type: Article

References (16)

1. F. Aurenhammer. Voronoi diagrams - A survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345-405, 1991.
2. F. Aurenhammer and R. Klein. Voronoi diagrams. Technical Report 198-5, Informatik, Fern Universität, Hagen, Germany, 1996.
3. W. H. E. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1(1):7-24, 1984.
4. D. Defays. An efficient algorithm for a complete link method. Computer Journal, 20:364-366, 1977.
5. A. D. Gordon. Classification. Chapman and Hall, London, 1981.
6. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ, 1988.
7. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12(1):28-35, 1983.
8. D. Krznaric and C. Levcopoulos. Computing a threaded quadtree (with links between neighbors) from the Delaunay triangulation in linear time. Proceedings of the 7th Canadian Conference on Computational Geometry, pp. 187-192, 1995.
9. D. Krznaric and C. Levcopoulos. Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time. Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 1026, pp. 443-455. Springer-Verlag, New York, 1995.
10. T. Kurita. An efficient agglomerative clustering algorithm using a heap. Pattern Recognition, 24(3):205-209, 1991.
11. Křivánek. Connected admissible hierarchical clustering. Paper presented at the DIANA III Conference, Bechyne, Czechoslovakia, June 1990.
12. X. Li. Parallel algorithms for hierarchical clustering and cluster validity. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(11):1088-1092, 1990.
13. F. Murtagh. Complexities of hierarchic clustering algorithms: State of the art. Computational Statistics Quarterly, 1:101-113, 1984.
14. M. H. Overmars and J. van Leeuwen. Some principles for dynamizing decomposable searching problems. Information Processing Letters, 12(1):49-54, 1981.
15. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
16. M. I. Shamos. Computational Geometry. Ph.D. thesis, Yale University, New Haven, CT, 1978.