Local equivalences of distances between clusterings -- a geometric perspective

DOI10.1007/s10994-011-5267-2zbMath1267.68187OpenAlexW2149657498MaRDI QIDQ420920

Marina Meilă

Publication date: 23 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-011-5267-2

zbMATH Keywords

clusteringconvexitymisclassification errorchi-square divergencecomparing partitionsrand index

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

Interpretable clustering using unsupervised binary trees ⋮ An indication of unification for different clustering approaches ⋮ Ensemble clustering by means of clustering embedding in vector spaces ⋮ Behavior-based clustering and analysis of interestingness measures for association rule mining ⋮ Parameterized dynamic cluster editing ⋮ Modularity revisited: a novel dynamics-based concept for decomposing complex networks ⋮ Good (K-means) clusterings are unique (up to small perturbations) ⋮ Optimal Bayesian estimators for latent variable cluster models ⋮ A population background for nonparametric density-based clustering ⋮ Parameterized Dynamic Cluster Editing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of statistical inference and information. Transl. from the Slovak by the author
• Support-vector networks
• Comparing clusterings -- an information based distance
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Mathematical classification and clustering
• A Sober Look at Clustering Stability
• Compressed sensing

This page was built for publication: Local equivalences of distances between clusterings -- a geometric perspective