2000 character limit reached
Dissimilarity Clustering by Hierarchical Multi-Level Refinement (1204.6509v1)
Published 29 Apr 2012 in stat.ML and cs.LG
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
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.