Algorithms for speeding up distance-based outlier detection

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 859-867

  Bhaduri, Kanishka ^a   Matthews, Bryan L ^a   Giannella, Chris R ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b MITRE CORPORATION   (United States)

Author keywords

Distributed computing; Nearest neighbor; Outlier detection

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INDEXING (OF INFORMATION); SIGNAL DETECTION; STATISTICS;

DISTANCE BASED OUTLIER DETECTION; INDEXING SCHEME; LARGE DATASETS; NEAREST-NEIGHBOUR; OUTLIER DETECTION; QUADRATIC TIME; SIMPLE++; STATE OF THE ART; STATE-OF-THE-ART METHODS; TIME COMPLEXITY;

CLUSTERING ALGORITHMS;

EID: 80052650750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020554     Document Type: Conference Paper

References (15)

1. F. Angiulli, S. Basta, S. Lodi, and C. Sartori. A Distributed Approach to Detect Outliers in Very Large Data Sets. In Proocedings of Euro-Par'10, pages 329-340, 2010.
2. F. Angiulli and F. Fassetti. DOLPHIN: An Efficient Algorithm for Mining Distance-based Outliers in Very Large Datasets. ACM TKDD, 3:4:1-4:57, 2009.
3. F. Angiulli and C. Pizzuti. Fast Outlier Detection in High Dimensional Spaces. In Proceedings of PKDD'02, pages 15-26, 2002.
4. S. Bay and M. Schwabacher. Mining distance-based outliers in near linear time with randomization and a simple pruning rule. In Proceedings of SIGKDD'03, pages 29-38, 2003.
5. J. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18:509-517, 1975.
6. S. Berchtold, D. Keim, and H. Kriegel. The X-tree : An Index Structure for High-Dimensional Data. In Proceedings of VLDB'96, pages 28-39, 1996.
7. M. Breunig, H. Kriegel, R. Ng, and J. Sander. LOF: Identifying Density-based Local Outliers. In Proceedings of SIGMOD'00, pages 93-104, 2000.
8. V. Chandola, A. Banerjee, and V. Kumar. Anomaly Detection: A Survey. ACM Computing Surveys, 41:15:1-15:58, 2009.
9. A. Ghoting, S. Parthasarathy, and M. Otey. Fast mining of distance-based outliers in high-dimensional datasets. DMKD, 16:349-364, 2008.
10. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of SIGMOD'84, pages 47-57, 1984. (Pubitemid 15469534)
11. E. Hung and D. Cheung. Parallel Mining of Outliers in Large Database. Distrib. Parallel Databases, 12:5-26, 2002. (Pubitemid 34720972)
12. E. Knorr and R. Ng. Algorithms for Mining Distance-Based Outliers in Large Datasets. In Proceedings of VLDB'98, pages 392-403, 1998.
13. E. Lozano and E. Acuna. Parallel Algorithms for Distance-Based and Density-Based Outliers. In Proceedings of ICDM'05, pages 729-732, 2005. (Pubitemid 47385782)
14. M. Otey, A. Ghoting, and S. Parthasarathy. Fast Distributed Outlier Detection in Mixed-Attribute Data Sets. DMKD, 12:203-228, 2006.
15. S. Ramaswamy, R. Rastogi, and K. Shim. Efficient Algorithms for Mining Outliers from Large Data Sets. In Proceedings of SIGMOD'00, pages 427-438, 2000.