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-citationDensity-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Sander, J., Ester, M., Kriegel, H.-P., & Xu, X. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009745219419 · Cited by 1,495
(2012) · Developments in Environmental Modelling · doi:10.1016/b978-0-444-53868-0.50018-6 · Cited by 1,320
SLINK: An optimally efficient algorithm for the single-link cluster method
Sibson, R. (1973) · The Computer Journal · doi:10.1093/comjnl/16.1.30 · Cited by 1,203
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
Self-citationEfficient algorithms for agglomerative hierarchical clustering methods
Day, W. H. E., & Edelsbrunner, H. (1984) · Journal of Classification · doi:10.1007/bf01890115 · Cited by 971
Deza, E., & Deza, M. M. (2009) · Springer eBooks · doi:10.1007/978-3-642-00234-2 · Cited by 950
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Vinh, N. X., Epps, J., & Bailey, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553511 · Cited by 938
On the History of the Minimum Spanning Tree Problem
Graham, R. L., & Hell, P. (1985) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1985.10011 · Cited by 813
An efficient algorithm for a complete link method
Defays, D. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.364 · Cited by 752
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276314 · Cited by 663
Cluster validity methods: part I
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2002) · ACM SIGMOD Record · doi:10.1145/565117.565124 · Cited by 534
Mathematical Classification and Clustering
Mirkin, B. (1996) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4613-0457-9 · Cited by 464
Geometric Data Analysis: From Correspondence Analysis to Structured Data Analysis
Le Roux, B., & Rouanet, H. (2005) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.1007/1-4020-2236-0 · Cited by 430
Xu, R., & Wunsch, D. C. (2008) · Wiley eBooks · doi:10.1002/9780470382776 · Cited by 406
Multidimensional clustering algorithms
Murtagh, F. D. (1985) · Cited by 386
Self-citationA Review of Hierarchical Classification
Gordon, A. D. (1987) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981629 · Cited by 380
Cluster validation techniques for genome expression data
Bolshakova, N., & Azuaje, F. (2003) · Signal Processing · doi:10.1016/s0165-1684(02)00475-9 · Cited by 331
Voice matters in a dictator game
Yamamori, T., Kato, K., Kawagoe, T., & Matsui, A. (2008) · Experimental Economics · doi:10.1007/s10683-007-9168-y · Cited by 324
WaveCluster: a wavelet-based clustering approach for spatial data in very large databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050009 · Cited by 293
The Literature On Cluster Analysis
Blashfield, R. K., & Aldenderfer, M. S. (1978) · Multivariate Behavioral Research · doi:10.1207/s15327906mbr1303_2 · Cited by 214
Zhang, Z., Murtagh, F., Van Poucke, S., Lin, S., & Lan, P. (2017) · Annals of Translational Medicine · doi:10.21037/atm.2017.02.05 · Cited by 196
Self-citationClustering properties of hierarchical self-organizing maps
Lampinen, J., & Oja, E. (1992) · Journal of Mathematical Imaging and Vision · doi:10.1007/bf00118594 · Cited by 191
On Similarity Indices and Correction for Chance Agreement
Albatineh, A. N., Niewiadomska-Bugaj, M., & Mihalko, D. (2006) · Journal of Classification · doi:10.1007/s00357-006-0017-z · Cited by 160
Grid-clustering: an efficient hierarchical clustering method for very large data sets
Schikuta, E. (1996) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1996.546732 · Cited by 159
White, H. D., & McCain, K. W. (1997) · Cited by 155
Uncovering hierarchical structure in data using the growing hierarchical self-organizing map
Dittenbach, M., Rauber, A., & Merkl, D. (2002) · Neurocomputing · doi:10.1016/s0925-2312(01)00655-5 · Cited by 136
(1971) · New England Journal of Medicine · doi:10.1056/nejm197106242842525 · Cited by 134
Fast hierarchical clustering and its validation
Dash, M., Liu, H., Scheuermann, P., & Tan, K. (2002) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(02)00138-6 · Cited by 112
The Kohonen self-organizing map method: An assessment
Murtagh, F. D., & Pajares, M. H. (1995) · Journal of Classification · doi:10.1007/bf03040854 · Cited by 112
Self-citationScript Recognition with Hierarchical Feature Maps
MUKKULAINEN, R. (1990) · Connection Science · doi:10.1080/09540099008915664 · Cited by 102
Statistical grid-based clustering over data streams
Park, N. H., & Lee, W. S. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974127 · Cited by 99
Hierarchical GTM: constructing localized nonlinear projection manifolds in a principled way
Peter Tiňo, B., & Nabney, I. T. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000238 · Cited by 98
Wang, Y., Luo, L., Freedman, M. T., & Kung, S. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846734 · Cited by 73
The structure of narrative: The case of film scripts
Murtagh, F. D., Ganz, A., & McKie, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.05.026 · Cited by 69
Self-citationTechniques for Structuring Database Records
March, S. T. (1983) · ACM Computing Surveys · doi:10.1145/356901.356904 · Cited by 65
A new cell-based clustering method for large, high-dimensional data in data mining applications
Chang, J., & Jin, D.-S. (2002) · ACM Symposium on Applied Computing · doi:10.1145/508791.508886 · Cited by 62
'1+1>2': merging distance and density based clustering
Dash, M., Liu, H., & Xu, X. (2001) · Database Systems for Advanced Applications · doi:10.1109/dasfaa.2001.916361 · Cited by 59
The Haar Wavelet Transform of a Dendrogram
Murtagh, F. D. (2007) · Journal of Classification · doi:10.1007/s00357-007-0007-9 · Cited by 52
Self-citationClustering spatial data in the presence of obstacles: a density-based approach
Zai͏̈ane, O. R., & Lee, C.-H. (2003) · International Database Engineering and Applications Symposium (IDEAS) · doi:10.1109/ideas.2002.1029674 · Cited by 38
Similarity and Dissimilarity Methods for Processing Chemical Structure Databases
Gillet, V. J. (1998) · The Computer Journal · doi:10.1093/comjnl/41.8.547 · Cited by 37
Murtagh, F. D. (2017) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315367491 · Cited by 22
Self-citationCUBN: A clustering algorithm based on density and distance
Wang, L., & Zheng-ou, W. (2004) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2003.1264452 · Cited by 8
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
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.