Efficient Algorithms for Mining Outliers from Large Data Sets
Summary: Outliers defined by kth-NN distance; rank by this metric and pick top-n. Partition-based pruning prunes regions to discard non-outliers early, beating nested-loop/index-join; NBA and synthetic data validate scalability with size and dimensionality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sridhar Ramaswamy (Epiphany Inc.)
- 2. Rajeev Rastogi (AT&T)
- 3. Kyuseok Shim (KAIST; Korea Advanced Institute of Science and Technology)
BibTeX Citation
@inproceedings{ramaswamy_sigmod00,
title = {{Efficient Algorithms for Mining Outliers from Large Data Sets}},
author = {Ramaswamy, Sridhar and Rastogi, Rajeev and Shim, Kyuseok},
series = {{SIGMOD} '00},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/342009.335437},
url = {https://dl.acm.org/doi/10.1145/342009.335437},
year = {2000}
}
Incoming Citations (Sorted by Pagerank)
Showing 27 of 27 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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.0011405675 |
| 28 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.00051312804 |
| 32 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00049737458 |
| 94 | Efficient and Effective Clustering Methods for Spatial Data Mining | 1994 | VLDB | 0.00034579889 |
| 142 | LOF: Identifying Density-Based Local Outliers | 2000 | SIGMOD | 0.00029202746 |
| 363 | CURE: An Efficient Clustering Algorithm for Large Databases | 1998 | SIGMOD | 0.00019987463 |
| 695 | Algorithms for Mining Distance-Based Outliers in Large Datasets | 1998 | VLDB | 0.00014702685 |
| 2,701 | Finding Intensional Knowledge of Distance-Based Outliers | 1999 | VLDB | 8.1185059e-05 |
| 5,299 | PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning | 1998 | VLDB | 6.1898928e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,405 | Adaptive Outlier Detection over Data Stream | 2026 | SIGMOD |
| 2 | 3,946 | Continuous Outlier Detection in Data Streams: An Extensible Framework and State-Of-The-Art Algorithms | 2013 | SIGMOD |
| 3 | 9,751 | Local Search Methods for k-Means with Outliers | 2017 | VLDB |
| 4 | 4,299 | Outlier Detection for High Dimensional Data | 2001 | SIGMOD |
| 5 | 2,701 | Finding Intensional Knowledge of Distance-Based Outliers | 1999 | VLDB |
| 6 | 10,393 | Clustering with Set Outliers and Applications in Relational Clustering | 2026 | PODS |
| 7 | 10,269 | On Saving Outliers for Better Clustering over Noisy Data | 2021 | SIGMOD |
| 8 | 10,139 | Distance-Based Outlier Detection: Consolidation and Renewed Bearing | 2010 | VLDB |
| 9 | 9,811 | Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach | 2021 | SIGMOD |
| 10 | 695 | Algorithms for Mining Distance-Based Outliers in Large Datasets | 1998 | VLDB |