Fast algorithms for complete linkage clustering

0.00 Avg rating—0 Votes

Article ID:	iaor19981997
Country:	United States
Volume:	19
Issue:	1
Start Page Number:	131
End Page Number:	145
Publication Date:	Jan 1998
Journal:	Discrete and Computational Geometry
Authors:	Krznaric D., Levcopoulos C.
Keywords:	geometry

Abstract:

It is shown that the complete linkage clustering of n points can be computed in >O(n log² n) time. Furthermore, it is shown that the complete linkage clustering can be approximated within an arbitrarily small constant factor in O(n log n) time.

Reviews

Required fields are marked *. Your email address will not be published.