A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
- 12 August 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '12
- p. 877-885
- https://doi.org/10.1145/2339530.2339669
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Angle-based outlier detection in high-dimensional dataPublished by Association for Computing Machinery (ACM) ,2008
- Fast mining of distance-based outliers in high-dimensional datasetsData Mining and Knowledge Discovery, 2008
- Mining distance-based outliers in near linear time with randomization and a simple pruning rulePublished by Association for Computing Machinery (ACM) ,2003
- Similarity estimation techniques from rounding algorithmsPublished by Association for Computing Machinery (ACM) ,2002
- Outlier detection for high dimensional dataPublished by Association for Computing Machinery (ACM) ,2001
- Efficient algorithms for mining outliers from large data setsPublished by Association for Computing Machinery (ACM) ,2000
- LOFPublished by Association for Computing Machinery (ACM) ,2000
- Multiple algorithms for fraud detectionKnowledge-Based Systems, 2000
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995