The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1967) · Cited by 23,719
(1996) · Cited by 20,179
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
The protein data bank: A computer-based archival file for macromolecular structures
Bernstein, F. C., Koetzle, T. F., Williams, G. J. B., Meyer, E. F., Brice, M. D., Rodgers, J. R., Kennard, O., Shimanouchi, T., & Tasumi, M. (1977) · Journal of Molecular Biology · doi:10.1016/s0022-2836(77)80200-3 · Cited by 8,578
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
Self-citationBIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
The FIRST Survey: Faint Images of the Radio Sky at Twenty Centimeters
Becker, R. H., White, R. L., & Helfand, D. J. (1995) · The Astrophysical Journal · doi:10.1086/176166 · Cited by 2,911
Cited by
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN
Schubert, E., Sander, J., Ester, M., Kriegel, H. P., & Xu, X. (2017) · ACM Transactions on Database Systems · doi:10.1145/3068335 · Cited by 2,737
Self-citationA Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
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
A high-bias, low-variance introduction to Machine Learning for physicists
Mehta, P., Bukov, M., Wang, C.-H., Day, A. G. R., Richardson, C., Fisher, C. K., & Schwab, D. J. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.03.001 · Cited by 920
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-citationA k-mean clustering algorithm for mixed numeric and categorical data
Ahmad, A., & Dey, L. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.03.016 · Cited by 718
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
Ertöz, L., Steinbach, M., & Kumar, V. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.5 · Cited by 703
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
Density-based clustering for real-time stream data
Chen, Y., & Tu, L. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281210 · Cited by 572
Study on density peaks clustering based on k-nearest neighbors and principal component analysis
Du, M., Ding, S., & Jia, H. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.02.001 · Cited by 520
Ludtmann, M. H. R., Angelova, P. R., Horrocks, M. H., Choi, M. L., Rodrigues, M., Baev, A. Y., Berezhnov, A. V., Yao, Z., Little, D., Banushi, B., et al. (2018) · Nature Communications · doi:10.1038/s41467-018-04422-2 · Cited by 513
Automated Algorithm Selection: Survey and Perspectives
Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00242 · Cited by 435
A clustering-based approach for discovering interesting places in trajectories
Palma, A. T., Bogorny, V., Kuijpers, B., & Alvares, L. O. (2008) · Proceedings of the 2008 ACM symposium on Applied computing · doi:10.1145/1363686.1363886 · Cited by 428
Machine Learning Based Workload Prediction in Cloud Computing
Gao, J., Wang, H., & Shen, H. (2020) · 2020 29th International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn49398.2020.9209730 · Cited by 311
A Self-Adaptive Parameter Selection Trajectory Prediction Approach via Hidden Markov Models
Qiao, S., Shen, D., Wang, X., Han, N., & Zhu, W. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2331758 · Cited by 297
Algorithms for hierarchical clustering: an overview,II
Murtagh, F., & Contreras, P. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1219 · Cited by 285
Synthetic minority oversampling technique for multiclass imbalance problems
Zhu, T., Lin, Y., & Liu, Y. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.07.024 · Cited by 275
A survey of density based clustering algorithms
Bhattacharjee, P., & Mitra, P. (2021) · Frontiers of Computer Science · doi:10.1007/s11704-019-9059-3 · Cited by 271
Spatiotemporal Data Mining: A Computational Perspective
Shekhar, S., Jiang, Z., Ali, R., Eftelioglu, E., Tang, X., Gunturi, V., & Zhou, X. (2015) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi4042306 · Cited by 206
The Role of Hubness in Clustering High-Dimensional Data
Tomasev, N., Radovanovic, M., Mladenic, D., & Ivanovic, M. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.25 · Cited by 142
MINTIME: Multi-Identity Size-Invariant Video Deepfake Detection
Coccomini, D. A., Zilos, G. K., Amato, G., Caldelli, R., Falchi, F., Papadopoulos, S., & Gennaro, C. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3409054 · Cited by 33
HUMAN - Hierarchical Clustering for Unsupervised Anomaly Detection & Interpretation
Mulinka, P., Casas, P., Fukuda, K., & Kencl, L. (2020) · 2020 11th International Conference on Network of the Future (NoF) · doi:10.1109/nof50125.2020.9249194 · Cited by 5
“Authors in [29], [44] recommend setting the value to MinPts ≥ 2 ∗ d - where d corresponds to the dimensionality of the data, whereas the research community often recommends setting MinPts ≥ d + 1 as a general rule.”
BackgroundFajardo, S., & Argüello, P. (2024) · Journal Of Anthropological Archaeology · doi:10.1016/j.jaa.2024.101628 · Cited by 4
Clustering of Temporal and Visual Data: Recent Advancements
Mudgal, P. (2026) · Data · doi:10.3390/data11010007 · Cited by 2
Bhardwaj, D., Feros, S. A., Luo, W., Hills, D., Kulshreshtha, R., Chaudhary, M., & Dwyer, D. B. (2026) · International Journal of Sports Science & Coaching · doi:10.1177/17479541261446089
Metadata
- Authors
- Sander, J., Ester, M., Kriegel, H.-P., & Xu, X.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 1998-06
- Volume
- 2
- Issue
- 2
- Pages
- 169-194
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2126751256
- Cited by
- 1,495
- References
- 29
- FWCI
- 9.19
- Type
- journal article
- 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
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.