Dissimilarity Clustering by Hierarchical Multi-Level Refinement

04/29/2012

∙

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

READ FULL TEXT

Dissimilarity Clustering by Hierarchical Multi-Level Refinement

Multi-level Graph Drawing using Infomap Clustering

A Method for Visuo-Spatial Classification of Freehand Shapes Freely Sketched

Multi-level conformal clustering: A distribution-free technique for clustering and anomaly detection

Multi-level Parareal algorithm with Averaging

Exploring Bayesian Models for Multi-level Clustering of Hierarchically Grouped Sequential Data

Tk-merge: Computationally Efficient Robust Clustering Under General Assumptions

A binary-activation, multi-level weight RNN and training algorithm for processing-in-memory inference with eNVM

Dissimilarity Clustering by Hierarchical Multi-Level Refinement

Related Research

Multi-level Graph Drawing using Infomap Clustering

A Method for Visuo-Spatial Classification of Freehand Shapes Freely Sketched

Multi-level conformal clustering: A distribution-free technique for clustering and anomaly detection

Multi-level Parareal algorithm with Averaging

Exploring Bayesian Models for Multi-level Clustering of Hierarchically Grouped Sequential Data

Tk-merge: Computationally Efficient Robust Clustering Under General Assumptions

A binary-activation, multi-level weight RNN and training algorithm for processing-in-memory inference with eNVM