The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Algorithms for hierarchical clustering: an overview,II
Open accessAbstract
We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self‐organizing maps and mixture models. We review grid‐based clustering, focusing on hierarchical density‐based approaches. Finally, we describe a recently developed very efficient (linear time) hierarchical clustering algorithm, which can also be viewed as a hierarchical grid‐based algorithm. This review adds to the earlier version, Murtagh F, Contreras P. Algorithms for hierarchical clustering: an overview,Wiley Interdiscip Rev: Data Mining Knowl Discov 2012, 2, 86–97.WIREs Data Mining Knowl Discov 2017, 7:e1219. doi: 10.1002/widm.1219 This article is categorized under:Algorithmic Development > Hierarchies and Trees Technologies > Classification Technologies > Structure Discovery and Clustering
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
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
Ward’s Hierarchical Agglomerative Clustering Method: Which Algorithms Implement Ward’s Criterion?
Murtagh, F., & Legendre, P. (2014) · Journal of Classification · doi:10.1007/s00357-014-9161-z · Cited by 3,782
Self-citationOn Clustering Validation Techniques
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001) · Journal of Intelligent Information Systems · doi:10.1023/a:1012801612483 · Cited by 2,646
Algorithms for hierarchical clustering: an overview
Murtagh, F., & Contreras, P. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.53 · Cited by 1,874
Self-citation
Cited by
Physics-Inspired Structural Representations for Molecules and Materials
Musil, F., Grisafi, A., Bartók, A. P., Ortner, C., Csányi, G., & Ceriotti, M. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00021 · Cited by 523
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
Oxytocin pathway gene networks in the human brain
Quintana, D. S., Rokicki, J., van der Meer, D., Alnæs, D., Kaufmann, T., Córdova-Palomera, A., Dieset, I., Andreassen, O. A., & Westlye, L. T. (2019) · Nature Communications · doi:10.1038/s41467-019-08503-8 · Cited by 354
Unsupervised machine learning in atomistic simulations, between predictions and understanding
Ceriotti, M. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5091842 · Cited by 173
Metadata
- Authors
- Murtagh, F., & Contreras, P.
- Venue
- WIREs Data Mining and Knowledge Discovery
- Publisher
- Wiley
- Published
- 2017-09-04
- Volume
- 7
- Issue
- 6
- ISSN
- 1942-4787 (ISSN-L)
- 1942-4795
- OpenAlex
- W4235145261
- Cited by
- 285
- References
- 52
- FWCI
- 6.40
- Type
- journal article
- Language
- en
- Open access
- green
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: Algorithms for hierarchical clustering: an overview,II. https://app.cochat.ai/papers/10.1002/widm.1219
- The paper
- Murtagh, F., & Contreras, P. (2017). Algorithms for hierarchical clustering: an overview,II. WIREs Data Mining and Knowledge Discovery. https://doi.org/10.1002/widm.1219
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.