Fast and explainable clustering based on sorting

arXiv:2202.01456v2 Announce Type: replace
Abstract: We introduce a fast and explainable clustering method called CLASSIX. It consists of two phases, namely a greedy aggregation phase of the sorted data into groups of nearby data points, followed by the merging of groups into clusters. The algorithm is controlled by two scalar parameters, namely a distance parameter for the aggregation and another parameter controlling the minimal cluster size. Extensive experiments are conducted to give a comprehensive evaluation of the clustering performance on …

abstract aggregation algorithm arxiv clustering cs.ds cs.lg data merging parameters sorting stat.co stat.ml the algorithm type