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
- 2. Rajeev Rastogi
- 3. Kyuseok Shim
Incoming Citations (Sorted by Pagerank)
Showing 25 of 25 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 |
|---|---|---|---|---|
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 27 | Efficient and Effective Clustering Methods for Spatial Data Mining | 1994 | VLDB | 0.00080736878 |
| 33 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00077324389 |
| 47 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0007015885 |
| 161 | LOF: Identifying Density-Based Local Outliers | 2000 | SIGMOD | 0.00039846974 |
| 341 | CURE: An Efficient Clustering Algorithm for Large Databases | 1998 | SIGMOD | 0.00026810548 |
| 774 | Algorithms for Mining Distance-Based Outliers in Large Datasets | 1998 | VLDB | 0.00016865771 |
| 2,822 | Finding Intensional Knowledge of Distance-Based Outliers | 1999 | VLDB | 8.0608136e-05 |
| 4,685 | PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning | 1998 | VLDB | 5.9994771e-05 |
Previous
Page 1 / 1
Next