Fast mining of distance-based outliers in high-dimensional datasets
- 4 March 2008
- journal article
- Published by Springer Science and Business Media LLC in Data Mining and Knowledge Discovery
- Vol. 16 (3), 349-364
- https://doi.org/10.1007/s10618-008-0093-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Fast Mining of Distance-Based Outliers in High-Dimensional DatasetsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2006
- Mining distance-based outliers in near linear time with randomization and a simple pruning rulePublished by Association for Computing Machinery (ACM) ,2003
- Fast Outlier Detection in High Dimensional SpacesLecture Notes in Computer Science, 2002
- Statistical Fraud Detection: A ReviewStatistical Science, 2002
- ADMITPublished by Association for Computing Machinery (ACM) ,2002
- An optimal algorithm for approximate nearest neighbor searching in fixed dimensionsJournal of the ACM, 1998
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- Principal Component AnalysisSpringer Series in Statistics, 1986
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975