Dissimilarity Clustering by Hierarchical Multi-Level Refinement
classification
📊 stat.ML
cs.LG
keywords
clusteringdissimilarityhierarchicalmethodmulti-levelquantizationrefinementachieves
read the original abstract
We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves better quantization errors than the
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.