A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data

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

Volumn , Issue , 2012, Pages 877-885

  Pham, Ninh ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

AMS sketch; angle based; high dimensional; outlier detection; random projection

Indexed keywords

AMS SKETCH; ANGLE-BASED; HIGH-DIMENSIONAL; OUTLIER DETECTION; RANDOM PROJECTIONS;

APPROXIMATION ALGORITHMS; RELIABILITY ANALYSIS; STATISTICS;

DATA MINING;

EID: 84866011202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339669     Document Type: Conference Paper

References (21)

1. C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the surprising behavior of distance metrics in high dimensional spaces. In Proceedings of ICDT'01, pages 420-434, 2001.
2. C. C. Aggarwal and P. S. Yu. Outlier detection for high dimensional data. In Proceedings of SIGMOD'01, pages 37-46, 2001.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
4. S. D. Bay and M. Schwabacher. Mining distance-based outliers in near linear time with randomization and a simple pruning rule. In Proceedings of KDD'03, pages 29-38, 2003.
5. V. Braverman, K.-M. Chung, Z. Liu, M. Mitzenmacher, and R. Ostrovsky. Ams without 4-wise independence on product domains. In Proceedings of STACS'10, pages 119-130, 2008.
6. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. Lof: Identifying density-based local outliers. In Proceedings of SIGMOD'00, pages 93-104, 2000.
7. M. Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of STOC'02, pages 380-388, 2002.
8. D. P. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009.
9. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
10. A. Ghoting, S. Parthasarathy, and M. E. Otey. Fast mining of distance-based outliers in high-dimensional datasets. Data Mining and Knowledge Discovery, 16(3):349-364, 2008.
11. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, 1995.
12. P. Indyk and A. McGregor. Declaring independence via the sketching of sketches. In Proceedings of SODA'08, pages 737-745, 2008.
13. E. M. Knorr and R. T. Ng. Algorithms for mining distance-based outliers in large datasets. In Proceedings of VLDB'98, pages 392-403, 1998.
14. H.-P. Kriegel, M. Schubert, and A. Zimek. Angle-based outlier detection in high-dimensional data. In Proceedings KDD'08, pages 444-452, 2008.
15. H.-P. Kriegel, M. Schubert, and A. Zimek. Outlier detection techniques. In Tutorial at KDD'10, 2010.
16. V. Mahadevan, W. Li, V. Bhalodia, and N. Vasconcelos. Anomaly detection in crowded scenes. In Proceedings of CVPR'10, pages 1975-1981, 2010.
17. E. Müller, M. Schiffer, and T. Seidl. Statistical selection of relevant subspace projections for outlier ranking. In Proceedings of ICDE'11, pages 434-445, 2011.
18. S. Papadimitriou, H. Kitagawa, P. B. Gibbons, and C. Faloutsos. Loci: Fast outlier detection using the local correlation integral. In Proceedings of ICDE'03, pages 315-326, 2003.
19. 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.
20. Y. Wang, S. Parthasarathy, and S. Tatikonda. Locality sensitive outlier detection: A ranking driven approach. In Proceedings of ICDE'11, pages 410-421, 2011.
21. R. Wheeler and J. S. Aitken. Multiple algorithms for fraud detection. Knowledge Based Systems, 13(2-3):93-99, 2000.