The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
OPTICS: ordering points to identify the clustering structure
Open accessAbstract
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, for many real-data sets there does not even exist a global parameter setting for which the result of the clustering algorithm describes the intrinsic clustering structure accurately. We introduce a new algorithm for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its density-based clustering structure. This cluster-ordering contains information which is equivalent to the density-based clusterings corresponding to a broad range of parameter settings. It is a versatile basis for both automatic and interactive cluster analysis. We show how to automatically and efficiently extract not only 'traditional' clustering information (e.g. representative points, arbitrary shaped clusters), but also the intrinsic clustering structure. For medium sized data sets, the cluster-ordering can be represented graphically and for very large data sets, we introduce an appropriate visualization technique. Both are suitable for interactive exploration of the intrinsic clustering structure offering additional insights into the distribution and correlation of the data.
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
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
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
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
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
Finding aggregate proximity relationships and commonalities in spatial data mining
Knorr, E. M., & Ng, R. T. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553156 · Cited by 86
Pixel-oriented database visualizations
Keim, D. A. (1996) · ACM SIGMOD Record · doi:10.1145/245882.245896 · Cited by 40
Cited by
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
Self-citationLOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149
“The feature vectors used are color histograms extracted from tv snapshots [2].”
MethodSelf-citationMulti-task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semantics
Cipolla, R., Gal, Y., & Kendall, A. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00781 · Cited by 3,151
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-citationClustering of time series data—a survey
Warren Liao, T. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.025 · Cited by 2,401
A 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
“OPTICS is an improvement of DBSCAN and it overcomes the shortcoming of DBSCAN that being sensitive to two parameters, the radius of the neighborhood and the minimum number of points in a neighborhood.”
BackgroundTrajectory clustering: a partition-and-group framework
Lee, J.-G., Han, J., & Whang, K.-Y. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247546 · Cited by 1,363
Cluster analysis for gene expression data: a survey
Jiang, D., Tang, C., & Zhang, A. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.68 · Cited by 1,235
CLARANS: a method for clustering objects for spatial data mining
Ng, R. T., & Han, J. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033770 · Cited by 1,202
Understanding mobility based on GPS data
Zheng, Y., Li, Q., Chen, Y., Xie, X., & Ma, W.-Y. (2008) · Proceedings of the 10th international conference on Ubiquitous computing · doi:10.1145/1409635.1409677 · Cited by 1,132
Kriegel, H.-P., Kröger, P., & Zimek, A. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1497577.1497578 · Cited by 1,093
Self-citationA Survey of Clustering Algorithms for Big Data: Taxonomy and Empirical Analysis
Fahad, A., Alshatri, N., Tari, Z., Alamri, A., Khalil, I., Zomaya, A. Y., Foufou, S., & Bouras, A. (2014) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2014.2330519 · Cited by 1,042
Overlapping community detection in networks: The state-of-the-art and comparative study
Xie, J., Kelley, S., & Szymanski, B. K. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501657 · Cited by 930
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
“In this section, we provide an extended description and discussion of our hierarchical clustering method, HDBSCAN* [Campello et al. 2013a], which can be seen as a conceptual and algorithmic improvement over OPTICS [Ankerst et al. 1999].”
BackgroundMethodInfluentialSelf-citationKriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
Self-citationComputational cluster validation in post-genomic data analysis
Handl, J., Knowles, J., & Kell, D. B. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti517 · Cited by 898
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
An Evolutionary Approach to Multiobjective Clustering
Handl, J., & Knowles, J. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.877146 · Cited by 717
Collaborative location and activity recommendations with GPS history data
Zheng, V. W., Zheng, Y., Xie, X., & Yang, Q. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772795 · Cited by 661
DBSCAN: Past, present and future
Rehman, S. U., Asghar, S., Fong, S., & Sarasvady, S. (2014) · The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014) · doi:10.1109/icadiwt.2014.6814687 · Cited by 606
Streaming-data algorithms for high-quality clustering
O'Callaghan, L., Mishra, N., Meyerson, A., Guha, S., & Motwani, R. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994785 · Cited by 577
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00765-8 · Cited by 570
Understanding transportation modes based on GPS data for web applications
Zheng, Y., Chen, Y., Li, Q., Xie, X., & Ma, W.-Y. (2010) · ACM Transactions on the Web · doi:10.1145/1658373.1658374 · Cited by 484
Recommending friends and locations based on individual location history
Zheng, Y., Zhang, L., Ma, Z., Xie, X., & Ma, W.-Y. (2011) · ACM Transactions on the Web · doi:10.1145/1921591.1921596 · Cited by 479
A Survey of Uncertain Data Algorithms and Applications
Aggarwal, C. C., & Yu, P. S. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.190 · Cited by 475
T-Finder: A Recommender System for Finding Passengers and Vacant Taxis
Yuan, N. J., Zheng, Y., Zhang, L., & Xie, X. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.153 · Cited by 432
On Discovering Moving Clusters in Spatio-temporal Data
Kalnis, P., Mamoulis, N., & Bakiras, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535331_21 · Cited by 420
Clustering Algorithms in Biomedical Research: A Review
Xu, R., & Wunsch, D. C. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2083647 · Cited by 349
Where to find my next passenger
Yuan, J., Zheng, Y., Zhang, L., Xie, X., & Sun, G. (2011) · Proceedings of the 13th international conference on Ubiquitous computing · doi:10.1145/2030112.2030128 · Cited by 343
The Effects of Data Quality on Machine Learning Performance on Tabular Data
Mohammed, S., Budach, L., Feuerpfeil, M., Ihde, N., Nathansen, A., Noack, N., Patzlaff, H., Naumann, F., & Harmouch, H. (2025) · Information Systems · doi:10.1016/j.is.2025.102549 · Cited by 331
Mining significant semantic locations from GPS data
Cao, X., Cong, G., & Jensen, C. S. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920968 · Cited by 329
A review of moving object trajectory clustering algorithms
Yuan, G., Sun, P., Zhao, J., Li, D., & Wang, C. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9477-7 · Cited by 323
A survey on data stream clustering and classification
Nguyen, H.-L., Woon, Y.-K., & Ng, W.-K. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-014-0808-1 · Cited by 321
Oberlaender, M., de Kock, C. P. J., Bruno, R. M., Ramirez, A., Meyer, H. S., Dercksen, V. J., Helmstaedter, M., & Sakmann, B. (2012) · Cerebral Cortex · doi:10.1093/cercor/bhr317 · Cited by 310
A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method
Mahesh Kumar, K., & Rama Mohan Reddy, A. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.03.008 · Cited by 308
Schubert, E., Zimek, A., & Kriegel, H.-P. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0300-z · Cited by 300
Self-citationVisual analytics tools for analysis of movement data
Andrienko, G., Andrienko, N., & Wrobel, S. (2007) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1345448.1345455 · Cited by 277
Business Intelligence for Enterprise Systems: A Survey
Duan, L., & Xu, L. D. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2188804 · Cited by 254
A Cluster-then-label Semi-supervised Learning Approach for Pathology Image Classification
Peikari, M., Salama, S., Nofech-Mozes, S., & Martel, A. L. (2018) · Scientific Reports · doi:10.1038/s41598-018-24876-0 · Cited by 161
Ascending neurons convey behavioral state to integrative sensory and action selection brain regions
Chen, C.-L., Aymanns, F., Minegishi, R., Matsuda, V. D. V., Talabot, N., Günel, S., Dickson, B. J., & Ramdya, P. (2023) · Nature Neuroscience · doi:10.1038/s41593-023-01281-z · Cited by 58
AHaH Computing–From Metastable Switches to Attractors to Machine Learning
Nugent, M. A., & Molter, T. W. (2014) · PLoS ONE · doi:10.1371/journal.pone.0085175 · Cited by 55
AMPA receptor anchoring at CA1 synapses is determined by N-terminal domain and TARP γ8 interactions
Watson, J. F., Pinggera, A., Ho, H., & Greger, I. H. (2021) · Nature Communications · doi:10.1038/s41467-021-25281-4 · Cited by 38
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
“OPTICS (Ordering Points To Identify the Clustering Structure) [31] is a density-based clustering algorithm extending DBSCAN, by producing a structure of augmented clusters-ordering with respect to the input parameters, up to a generating distance ǫ .”
Method
Metadata
- Authors
- Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J.
- Venue
- Proceedings of the 1999 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 1999-06
- Pages
- 49-60
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W4247105055
- Cited by
- 1,335
- References
- 12
- FWCI
- 6.51
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.