DBScholar

Back to papers

OPTICS: Ordering Points To Identify the Clustering Structure

Summary: OPTICS builds a density-based cluster-ordering instead of explicit clusters. This ordering reveals intrinsic structure across parameter settings, enabling automatic, interactive discovery and scalable visualization for medium to very large data sets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3149
Venue
SIGMOD
Year
1999
Pagerank
0.00022264197
Overall Rank
291 | 98.01%
DOI
10.1145/304182.304187

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ankerst_sigmod99,
        title = {{OPTICS: Ordering Points To Identify the Clustering Structure}},
        author = {Ankerst, Mihael and Breunig, Markus M. and Kriegel, Hans-Peter and Sander, Jörg},
        series = {{SIGMOD} '99},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/304182.304187},
        url = {https://dl.acm.org/doi/10.1145/304182.304187},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 44 of 44 citing papers.

Rank Citing Paper Year Venue Pagerank
142 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.0002962566
907 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00013309819
918 Trajectory Clustering: A Partition-and-Group Framework 2007 SIGMOD 0.00013215285
962 DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation 2015 SIGMOD 0.00012936472
1,993 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.3421788e-05
3,020 Dynamic Density Based Clustering 2017 SIGMOD 7.8445412e-05
3,234 RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning 2018 SIGMOD 7.6144184e-05
3,862 CSV: Visualizing and Mining Cohesive Subgraphs 2008 SIGMOD 7.0665158e-05
4,043 ST2B-tree: A Self-Tunable Spatio-Temporal B+-tree Index for Moving Objects 2008 SIGMOD 6.9403241e-05
4,151 YADING: Fast Clustering of Large-Scale Time Series Data 2015 VLDB 6.8703273e-05
4,358 Parallel Index-Based Structural Graph Clustering and Its Approximation 2021 SIGMOD 6.7459836e-05
4,651 Density-based Place Clustering in Geo-Social Networks 2014 SIGMOD 6.585234e-05
4,856 Computing Clusters of Correlation Connected Objects 2004 SIGMOD 6.4752952e-05
5,294 Theoretically-Efficient and Practical Parallel DBSCAN 2020 SIGMOD 6.2790627e-05
5,867 Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space 2018 SIGMOD 6.0613257e-05
5,895 The 3W Model and Algebra for Unified Data Mining 2000 VLDB 6.0486927e-05
6,205 Outlier-robust Clustering using Independent Components 2008 SIGMOD 5.9443504e-05
6,435 Mining Significant Semantic Locations From GPS Data 2010 VLDB 5.8794105e-05
6,956 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.7303405e-05
7,023 C2P: Clustering based on Closest Pairs 2001 VLDB 5.7242118e-05
7,291 Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering 2004 SIGMOD 5.6539603e-05
7,602 Clustering Objects on a Spatial Network 2004 SIGMOD 5.5866563e-05
8,070 Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms 2024 SIGMOD 5.4938502e-05
8,215 CURLER: Finding and Visualizing Nonlinear Correlation Clusters 2005 SIGMOD 5.4651579e-05
8,733 FINEX: A Fast Index for Exact & Flexible Density-Based Clustering 2023 SIGMOD 5.3766157e-05
9,013 Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering 2001 SIGMOD 5.3321448e-05
9,262 Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects 2003 SIGMOD 5.2968259e-05
9,272 A Framework for Projected Clustering of High Dimensional Data Streams 2004 VLDB 5.2945481e-05
9,311 Time2State: An Unsupervised Framework for Inferring the Latent States in Time Series Data 2023 SIGMOD 5.289545e-05
9,444 An Efficient Algorithm for Distance-based Structural Graph Clustering 2023 SIGMOD 5.2675506e-05
10,065 On Saving Outliers for Better Clustering over Noisy Data 2021 SIGMOD 5.1648805e-05
10,567 FB*: A Compact Index for Efficient and Exact Density-based Clustering 2026 VLDB 5.093636e-05
10,603 Schuyler: Self-Supervised Clustering of Tables in Relational Databases 2026 VLDB 5.093636e-05
10,607 CLaP - State Detection from Time Series 2026 VLDB 5.093636e-05
10,878 Evaluating Methods for Efficient Entity Count Estimation 2025 VLDB 5.093636e-05
10,978 Time-Series Clustering: A Comprehensive Study of Data Mining, Machine Learning, and Deep Learning Methods 2025 VLDB 5.093636e-05
11,253 Ensemble Clustering based on Meta-Learning and Hyperparameter Optimization 2024 VLDB 5.093636e-05
11,420 F3 KM: Federated, Fair, and Fast k-means 2023 SIGMOD 5.093636e-05
11,661 PyExplore: Query Recommendations for Data Exploration without Query Logs 2021 SIGMOD 5.093636e-05
11,664 Fast Density-Peaks Clustering: Multicore-based Parallelization Approach 2021 SIGMOD 5.093636e-05
11,675 Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* 2021 SIGMOD 5.093636e-05
11,947 MustaCHE: A Multiple Clustering Hierarchies Explorer 2018 VLDB 5.093636e-05
12,815 A Shrinking-Based Approach for Multi-Dimensional Data Analysis 2003 VLDB 5.093636e-05
12,816 Data Bubbles for Non-Vector Data: Speeding-up Hierarchical Clustering in Arbitrary Metric Spaces 2003 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
31 BIRCH: An Efficient Data Clustering Method for Very Large Databases 1996 SIGMOD 0.00050347119
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040719947
85 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00035405879
88 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00035240327
304 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD 0.00021917388
351 CURE: An Efficient Clustering Algorithm for Large Databases 1998 SIGMOD 0.00020424271
1,907 Incremental Clustering for Mining in a Data Warehousing Environment 1998 VLDB 9.501636e-05
1,941 WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases 1998 VLDB 9.4453261e-05
5,177 Databases and Visualization 1996 SIGMOD 6.3305358e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 3,663 Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering 1999 VLDB
2 10,567 FB*: A Compact Index for Efficient and Exact Density-based Clustering 2026 VLDB
3 6,205 Outlier-robust Clustering using Independent Components 2008 SIGMOD
4 4,812 Clustering by Pattern Similarity in Large Data Sets 2002 SIGMOD
5 11,664 Fast Density-Peaks Clustering: Multicore-based Parallelization Approach 2021 SIGMOD
6 10,352 Categorical Data Clustering via Value Order Estimated Distance Metric Learning 2026 SIGMOD
7 1,646 Fast Algorithms for Projected Clustering 1999 SIGMOD
8 14,127 Clustering Methods for Large Databases: From the Past to the Future 1999 SIGMOD
9 304 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD
10 5,867 Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space 2018 SIGMOD