The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Bayesian hierarchical clustering
Abstract
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages over traditional distance-based agglomerative clustering algorithms. (1) It defines a probabilistic model of the data which can be used to compute the predictive distribution of a test point and the probability of it belonging to any of the existing clusters in the tree. (2) It uses a model-based criterion to decide on merging clusters rather than an ad-hoc distance metric. (3) Bayesian hypothesis testing is used to decide which merges are advantageous and to output the recommended depth of the tree. (4) The algorithm can be interpreted as a novel fast bottom-up approximate inference method for a Dirichlet process (i.e. countably infinite) mixture model (DPM). It provides a new lower bound on the marginal likelihood of a DPM by summing over exponentially many clusterings of the data in polynomial time. We describe procedures for learning the model hyperpa-rameters, computing the predictive distribution, and extensions to the algorithm. Experimental results on synthetic and real-world data sets demonstrate useful properties of the algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Model-Based Gaussian and Non-Gaussian Clustering
Banfield, J. D., & Raftery, A. E. (1993) · Biometrics · doi:10.2307/2532201 · Cited by 2,395
Ferguson Distributions Via Polya Urn Schemes
Blackwell, D., & MacQueen, J. B. (1973) · The Annals of Statistics · doi:10.1214/aos/1176342372 · Cited by 1,329
The Infinite Gaussian Mixture Model
Rasmussen, C. E. (1999) · Cited by 1,057
Chipman, H. A., George, E. I., & McCulloch, R. E. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473750 · Cited by 734
Bayesian Methods for Nonlinear Classification and Regression
Denison, D. G. T. (2002) · Medical Entomology and Zoology · Cited by 496
Cluster analysis of gene expression dynamics
Ramoni, M. F., Sebastiani, P., & Kohane, I. S. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.132656399 · Cited by 465
Hidden Markov Model Induction by Bayesian Model Merging
Stolcke, A., & Omohundro, S. M. (1992) · Cited by 236
Variational methods for the Dirichlet process
Blei, D. M., & Jordan, M. I. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015439 · Cited by 179
Semi-Supervised Learning with Trees
Kemp, C., Griffiths, T. L., Stromsten, S., & Tenenbaum, J. B. (2003) · Cited by 58
Cited by
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
Blei, D. M., Griffiths, T. L., & Jordan, M. I. (2010) · Journal of the ACM · doi:10.1145/1667053.1667056 · Cited by 646
Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimization
Dizaji, K. G., Herandi, A., Deng, C., Cai, W., & Huang, H. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.612 · Cited by 579
Deterministic Local Interpretable Model-Agnostic Explanations for Stable Explainability
Zafar, M. R., & Khan, N. (2021) · Machine Learning and Knowledge Extraction · doi:10.3390/make3030027 · Cited by 374
2D Materials in Flexible Electronics: Recent Advances and Future Prospectives
Katiyar, A. K., Hoang, A. T., Xu, D., Hong, J., Kim, B. J., Ji, S., & Ahn, J.-H. (2024) · Chemical Reviews · doi:10.1021/acs.chemrev.3c00302 · Cited by 363
Comprehensive survey on hierarchical clustering algorithms and the recent developments
Ran, X., Xi, Y., Lu, Y., Wang, X., & Lu, Z. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10366-3 · Cited by 361
Metadata
- Authors
- Heller, K. A., & Ghahramani, Z.
- Venue
- Proceedings of the 22nd international conference on Machine learning - ICML '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 297-304
- OpenAlex
- W2128999403
- Cited by
- 357
- References
- 11
- FWCI
- 5.49
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bayesian hierarchical clustering. https://app.cochat.ai/papers/10.1145/1102351.1102389
- The paper
- Heller, K. A., & Ghahramani, Z. (2005). Bayesian hierarchical clustering. Proceedings of the 22nd international conference on Machine learning - ICML '05. https://doi.org/10.1145/1102351.1102389
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.