An effective and efficient algorithm for high-dimensional outlier detection
- 1 April 2005
- journal article
- research article
- Published by Springer Science and Business Media LLC in The VLDB Journal
- Vol. 14 (2), 211-221
- https://doi.org/10.1007/s00778-004-0125-5
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On the use of conceptual reconstruction for mining massively incomplete data setsIEEE Transactions on Knowledge and Data Engineering, 2003
- On the Surprising Behavior of Distance Metrics in High Dimensional SpaceLecture Notes in Computer Science, 2001
- Re-designing distance functions and distance-based applications for high dimensional dataACM SIGMOD Record, 2001
- Finding generalized projected clusters in high dimensional spacesPublished by Association for Computing Machinery (ACM) ,2000
- Fast algorithms for projected clusteringPublished by Association for Computing Machinery (ACM) ,1999
- When Is “Nearest Neighbor” Meaningful?Lecture Notes in Computer Science, 1999
- Optimized Crossover for the Independent Set ProblemOperations Research, 1997
- BIRCHACM SIGMOD Record, 1996
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993
- Optimization by Simulated AnnealingScience, 1983