Expected-time complexity results for hierarchic clustering algorithms which use cluster centres

Publisher Website

1 June 1983

journal article
Published by Elsevier in Information Processing Letters

Vol. 16 (5) , 237-241
https://doi.org/10.1016/0020-0190(83)90095-9

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

Reflexive Nearest Neighbours
Published by JSTOR ,1981
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software, 1980
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
IEEE Transactions on Computers, 1978
A probabilistic minimum spanning tree algorithm
Information Processing Letters, 1978