Efficient Pruning Schemes for Distance-Based Outlier Detection
- 1 January 2009
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Online Outlier Detection Based on Relative Neighbourhood DissimilarityLecture Notes in Computer Science, 2008
- Fast Mining of Distance-Based Outliers in High-Dimensional DatasetsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2006
- An effective and efficient algorithm for high-dimensional outlier detectionThe VLDB Journal, 2005
- Outlier mining in large high-dimensional data setsIEEE Transactions on Knowledge and Data Engineering, 2005
- Mining distance-based outliers in near linear time with randomization and a simple pruning rulePublished by Association for Computing Machinery (ACM) ,2003
- Clustering data streams: theory and practiceIEEE Transactions on Knowledge and Data Engineering, 2003
- Mining needle in a haystackPublished 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
- Unified Algorithm for Undirected Discovery of Exception RulesLecture Notes in Computer Science, 2000