Efficient shared near neighbours clustering of large metric data sets

摘要

Very few clustering methods are capable of clustering data without assuming the availability of operations which are defined only in strongly structured spaces,such as vector spaces.We propose an efficient data clustering method based on the shared near neighbours approach,which requires only a distance definition and is capable of discovering clusters of any shape.Using efficient data structures for querying metric data and a scheme for aprtitioning and sampling the data,the method can cluster effectively and efficiently dat asets whose size exceeds the internal memory size.