The DOI matches its Crossref record; 26 of the 27 references it cites were found in a registry or an index.
Density-Based Clustering Based on Hierarchical Density Estimates
Overview
Integrity signals
Registry
Cites
Statistics
Verification
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?
In the citing paper
“Small values produce numerous small clusters potentially appearing only at extreme density thresholds, whereas larger values merge smaller groups into fewer, more stable clusters, that can potentially hide the variability of the patterns observed.”
From Ecological legacies of pre-columbian settlements evident in palm clusters of neotropical mountain forests (2026) · cites this paper as [65]
In the citing paper
“HDBSCAN is adept at clustering outputs from LLMs due to its ability to manage clusters with varied densities, autonomously identify the number of clusters, and filter out noise as outlier data.”
From Large language model trained on clinical oncology data predicts cancer progression (2025) · cites this paper as [54]
Citations
Cites
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 24,190
(1996) · Cited by 20,179
Self-citationHubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Chiu, S., & Tavella, D. (2008) · Routledge eBooks · doi:10.4324/9780080878096-12 · Cited by 6,987
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
Self-citationThe Amsterdam Library of Object Images
Geusebroek, J., Burghouts, G. J., & Smeulders, A. W. M. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000042993.50813.60 · Cited by 919
Kriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
Self-citationFast and effective text mining using linear-time document clustering
Larsen, B., & Aone, C. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.312186 · Cited by 869
Model-based clustering and data transformations for gene expression data
Yeung, K. Y., Fraley, C., Murua, A., Raftery, A. E., & Ruzzo, W. L. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.10.977 · Cited by 869
Paulovich, F. V., Nonato, L. G., Minghim, R., & Levkowitz, H. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70443 · Cited by 317
Clustering gene-expression data with repeated measurements
Yeung, K. Y., Medvedovic, M., & Bumgarner, R. E. (2003) · Genome biology · doi:10.1186/gb-2003-4-5-r34 · Cited by 229
Excess Mass Estimates and Tests for Multimodality
Müller, D. W., & Sawitzki, G. (1991) · Journal of the American Statistical Association · doi:10.1080/01621459.1991.10475103 · Cited by 220
A General Approach to Clustering in Large Databases with Noise
Hinneburg, A., & Keim, D. A. (2003) · Knowledge and Information Systems · doi:10.1007/s10115-003-0086-9 · Cited by 155
A Generalized Single Linkage Method for Estimating the Cluster Tree of a Density
Stuetzle, W., & Nugent, R. (2009) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.07049 · Cited by 124
Efficiency issues of evolutionary k-means
Naldi, M. C., Campello, R. J. G. B., Hruschka, E. R., & de Carvalho, A. C. P. L. F. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2010.06.010 · Cited by 123
Self-citationSander, J. (2010) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_211 · Cited by 116
Self-citationAutomatic Extraction of Clusters from Hierarchical Clustering Representations
Sander, J., Qin, X., Lu, Z., Niu, N., & Kovarsky, A. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36175-8_8 · Cited by 113
Self-citationSemi-supervised Density-Based Clustering
Lelis, L. H. S., & Sander, J. (2009) · Proceedings · doi:10.1109/icdm.2009.143 · Cited by 105
Self-citationSun, H., Huang, J., Han, J., Deng, H., Zhao, P., & Feng, B. (2010) · Proceedings · doi:10.1109/icdm.2010.69 · Cited by 76
DECODE: a new method for discovering clusters of different densities in spatial data
Pei, T., Jasra, A., Hand, D. J., Zhu, A., & Zhou, C. (2008) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0120-3 · Cited by 74
Gupta, G., Liu, A. E., & Ghosh, J. (2009) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2008.32 · Cited by 39
Estimation of the number of clusters and influence zones
Herbin, M., Bonnet, N., & Vautrot, P. (2001) · Pattern Recognition Letters · doi:10.1016/s0167-8655(01)00103-9 · Cited by 35
Automatic aspect discrimination in data clustering
Horta, D., & Campello, R. J. G. B. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2012.05.011 · Cited by 22
Self-citationSander, J. (2016) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7502-7_70-1 · Cited by 11
Self-citationHierarchical Density Shaving: A clustering and visualization framework for large biological datasets
Gupta, G., Liu, A. E., & Ghosh, J. (2006) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2006.92 · Cited by 8
Cited by
Sorted by citations
hdbscan: Hierarchical density based clustering
McInnes, L., Healy, J., & Astels, S. (2017) · The Journal of Open Source Software · doi:10.21105/joss.00205 · Cited by 2,833
Schubert, E., Sander, J., Ester, M., Kriegel, H., & Xu, X. (2017) · ACM Transactions on Database Systems · doi:10.1145/3068335 · Cited by 2,789
Self-citationMachine Learning for Internet of Things Data Analysis: A Survey
Mahdavinejad, M. S., Rezvan, M., Barekatain, M., Adibi, P., Barnaghi, P. M., & Sheth, A. (2017) · Surrey Research Insight Open Access (The University of Surrey) · Cited by 1,008
Machine learning for internet of things data analysis: a survey
Mahdavinejad, M. S., Rezvan, M., Barekatain, M., Adibi, P., Barnaghi, P., & Sheth, A. P. (2018) · Digital Communications and Networks · doi:10.1016/j.dcan.2017.10.002 · Cited by 921
Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection
Campello, R. J. G. B., Moulavi, D., Zimek, A., & Sander, J. (2015) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2733381 · Cited by 915
Self-citation
Metadata
- Authors
- Campello, R. J. G. B., Moulavi, D., & Sander, J.
- Affiliations
- University of Alberta (CA)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Volume
- 7819
- Pages
- 160-172
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W151377110
- Cited by
- 2,680
- References
- 27
- Citations by year
- 2026: 413 · 2025: 497 · 2024: 404 · 2023: 337 · 2022: 271 · 2021: 253 · 2020: 181 · 2019: 148 · 2018: 84 · 2017: 50 · 2016: 24 · 2015: 9 · 2014: 9
- FWCI
- 9.26
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- ResearchOnline - JCU (James Cook University) (submittedVersion)
- Lecture Notes in Artificial Intelligence
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Physical Sciences › Computer Science › Information Systems › Data Management and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
- Keywords
- density-based clustering, hierarchical clustering, density limit
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
