Hierarchical Clustering
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Hierarchical clustering can be computationally expensive, especially for large datasets, and its performance heavily depends on the choice of distance metric and linkage criterion.
“However, hierarchical clustering can be computationally expensive, especially for large datasets, and its performance heavily depends on the choice of distance metric and linkage criterion [181] [175].”
From Comparative Analysis of Intrusion Detection Systems and Machine Learning Based Model Analysis through Decision Tree (2023) · cites this paper as [175]
Cites
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 21,341 · see citing works
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256 · see citing works
Ward’s Hierarchical Agglomerative Clustering Method: Which Algorithms Implement Ward’s Criterion?
Murtagh, F. D., & Legendre, P. (2014) · Journal of Classification · doi:10.1007/s00357-014-9161-z · Cited by 3,939 · see citing works
Minimum Spanning Trees and Single Linkage Cluster Analysis
Gower, J. C., & Ross, G. J. S. (1969) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2346439 · Cited by 1,245 · see citing works
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,219 · see citing works
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. D. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,074 · see citing works
An efficient algorithm for a complete link method
Defays, D. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.364 · Cited by 763 · see citing works
Parallel algorithms for hierarchical clustering
Olson, C. F. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00017-i · Cited by 406 · see citing works
A general theory of classificatory sorting strategies: II. Clustering systems
Lance, G. N. (1967) · The Computer Journal · doi:10.1093/comjnl/10.3.271 · Cited by 269 · see citing works
Center-based clustering under perturbation stability
Awasthi, P., Blum, A. L., & Sheffet, O. (2011) · Information Processing Letters · doi:10.1016/j.ipl.2011.10.006 · Cited by 110 · see citing works
Non-uniqueness and Inversions in Cluster Analysis
Morgan, B. J. T., & Ray, A. P. G. (1995) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2986199 · Cited by 82 · see citing works
Deza, M. M., & Deza, E. I. (2014) · Springer eBooks · doi:10.1007/978-3-662-44342-2_29 · Cited by 1 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Azam, Z., Islam, M. M., & Huda, M. N. (2023) · IEEE Access · doi:10.1109/access.2023.3296444 · Cited by 265 · see citing works
Al-Jawad, J., Ford, J., Petavratzi, E., & Hughes, A. (2024) · Science of The Total Environment · doi:10.1016/j.scitotenv.2023.167647 · Cited by 17 · see citing works
Clustering of Temporal and Visual Data: Recent Advancements
Mudgal, P. (2026) · Data · doi:10.3390/data11010007 · Cited by 2 · see citing works
- Authors
- Nielsen, F.
- Affiliations
- École Polytechnique (FR)
- Corresponding author
- Nielsen, Frank
- ORCID
- Nielsen, Frank
- Venue
- Undergraduate Topics in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2016
- Pages
- 195-211
- ISSN
- 1863-7310 (ISSN-L)
- 2197-1781
- OpenAlex
- W4231410305
- Cited by
- 494
- References
- 12
- Citations by year
- 2026: 50 · 2025: 115 · 2024: 109 · 2023: 101 · 2022: 63 · 2021: 33 · 2020: 17 · 2019: 1 · 2018: 2 · 2017: 1 · 2016: 2
- FWCI
- 3.50
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Undergraduate topics in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
- Keywords
- hierarchical clustering, agglomerative clustering, dendrogram, Ward linkage, single linkage, average linkage, complete linkage, monotonicity, inversion
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
