paper-with-me

Papers

Maximum Likelihood Estimation for Single Linkage Hierarchical Clustering

2015-11-25 · Dekang Zhu, Dan P. Guralnik, Xuezhi Wang, Xiang Li, Bill Moran

We derive a statistical model for estimation of a dendrogram from single linkage hierarchical clustering (SLHC) that takes account of uncertainty through noise or corruption in the measurements of separation of data. Our focus is on just the estimation of the hierarchy of partitions afforded by the dendrogram, rather than the heights in the latter. The concept of estimating this "dendrogram structure'' is introduced, and an approximate maximum likelihood estimator (MLE) for the dendrogram structure is described. These ideas are illustrated by a simple Monte Carlo simulation that, at least for small data sets, suggests the method outperforms SLHC in the presence of noise.

📄 PDF Abstract BibTeX arXiv:1511.07944

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringSmall Data Image Classification

Similar Papers 제목 키워드 기반

Statistical Properties of the Single Linkage Hierarchical Clustering Estimator

2015-11-24 · Dekang Zhu, Dan P. Guralnik, Xuezhi Wang, Xiang Li 외

Distance-based hierarchical clustering (HC) methods are widely used in unsupervised data analysis but few authors take account of uncertainty in the distance data. We incorporate a statistical model of the uncertainty th…

Clustering

The Cluster Graphical Lasso for improved estimation of Gaussian graphical models

2013-07-19 · Kean Ming Tan, Daniela Witten, Ali Shojaie

We consider the task of estimating a Gaussian graphical model in the high-dimensional setting. The graphical lasso, which involves maximizing the Gaussian log likelihood subject to an l1 penalty, is a well-studied approa…

ClusteringModel Selection

Hierarchical Linkage Clustering Beyond Binary Trees and Ultrametrics

2025-11-22 · Maximilien Dreveton, Matthias Grossglauser, Daichi Kuroda, Patrick Thiran arxiv

Hierarchical clustering seeks to uncover nested structures in data by constructing a tree of clusters, where deeper levels reveal finer-grained relationships. Traditional methods, including linkage approaches, face three…

New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering

2024-05-02 · Sanjoy Dasgupta, Eduardo Laber

Linkage methods are among the most popular algorithms for hierarchical clustering. Despite their relevance the current knowledge regarding the quality of the clustering produced by these methods is limited. Here, we impr…

Clustering

Asymptotic Accuracy of Bayesian Estimation for a Single Latent Variable

2014-08-25 · Keisuke Yamazaki

In data science and machine learning, hierarchical parametric models, such as mixture models, are often used. They contain two kinds of variables: observable variables, which represent the parts of the data that can be d…