Finding local anomalies in very high dimensional space

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 128-137

  De Vries, Timothy ^a   Chawla, Sanjay ^a   Houle, Michael E ^b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Anomaly detection; Dimensionality reduction

Indexed keywords

ANOMALY DETECTION; CORE DENSITIES; CRITICAL FACTORS; DATA ANALYSIS TECHNIQUES; DATA SETS; DIMENSIONALITY REDUCTION; HIGH DIMENSIONAL SPACES; HIGH-DIMENSIONAL; LOCAL OUTLIER FACTORS; NEAREST-NEIGHBOUR; NOVEL TECHNIQUES; PROJECTION METHOD; RANDOM PROJECTIONS; REAL WORLD DATA; REDUCED DIMENSIONAL SPACE; REDUCED DIMENSIONALITY;

ENERGY EFFICIENCY;

DATA MINING;

EID: 79951739637     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.151     Document Type: Conference Paper

References (20)

1. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander, "Lof: identifying density-based local outliers," SIGMOD Rec., vol. 29, no. 2, pp. 93-104, 2000.
2. G. H. Golub and C. F. Van Loan, Matrix computations (3rd ed.). Baltimore, MD, USA: Johns Hopkins University Press, 1996.
3. E. M. Knorr, R. T. Ng, and V. Tucakov, "Distance-based outliers: algorithms and applications," The VLDB Journal, vol. 8, no. 3-4, pp. 237-253, 2000.
4. J.-M. Geusebroek, G. J. Burghouts, and A. W. M. Smeulders, "The amsterdam library of object images," International Journal of Computer Vision, vol. 61, no. 1, pp. 103-112, 2005.
5. S. D. Bay and M. Schwabacher, "Mining distance-based outliers in near linear time with randomization and a simple pruning rule," in KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2003, pp. 29-38.
6. A. Hinneburg, C. C. Aggarwal, and D. A. Keim, "What is the nearest neighbor in high dimensional spaces?" in VLDB '00: Proceedings of the 26th International Conference on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2000, pp. 506-515.
7. J. B. Tenenbaum, V. d. Silva, and J. C. Langford, "A Global Geometric Framework for Nonlinear Dimensionality Reduction," Science, vol. 290, no. 5500, pp. 2319-2323, 2000. (Pubitemid 32041577)
8. S. Papadimitriou, H. Kitagawa, P. B. Gibbons, and C. Faloutsos, "Loci: Fast outlier detection using the local correlation integral," in ICDE, 2003.
9. W. Jin, A. K. H. Tung, and J. Han, "Mining top-n local outliers in large databases," in KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2001, pp. 293-298.
10. P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 1998, pp. 604-613.
11. M. E. Houle and J. Sakuma, "Fast approximate similarity search in extremely high-dimensional data sets," in ICDE, 2005, pp. 619-630. (Pubitemid 41731188)
12. H.-P. Kriegel, P. Kröger, E. Schubert, and A. Zimek, "Outlier detection in axis-parallel subspaces of high dimensional data," in Proceedings of the 13th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Bangkok, Thailand, 2009.
13. A. Sharma and K. K. Paliwal, "Fast principal component analysis using fixed-point algorithm," Pattern Recognition Letters, vol. 28, no. 10, pp. 1151-1155, 2007. (Pubitemid 46710169)
14. S. Deegalla and H. Bostrom, "Reducing high-dimensional data by principal component analysis vs. random projection for nearest neighbor classification," in ICMLA '06: Proceedings of the 5th International Conference on Machine Learning and Applications. Washington, DC, USA: IEEE Computer Society, 2006, pp. 245-250. (Pubitemid 351337064)
15. W. B. Johnson and J. Lindenstrauss, "Extensions of lipschitz mappings into a hilbert space," in Conference in modern analysis and probability (New Haven, Conn.). Amer. Math. Soc., 1982, pp. 189-206.
16. S. Dasgupta and A. Gupta, "An elementary proof of the johnson-lindenstrauss lemma," International Computer Science Institute, Berkeley, CA, Technical Report TR-99-006, 1999.
17. D. Achlioptas, "Database-friendly random projections," in 20th ACM Symposium on Principles of Database Systems. ACM, 2001, pp. 274-281. (Pubitemid 32865990)
18. D. R. Karger and M. Ruhl, "Finding nearest neighbors in growth-restricted metrics," in STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 2002, pp. 741-750. (Pubitemid 35009437)
19. C. K. Yap, "A geometric consistency theorem for a symbolic perturbation scheme," in SCG '88: Proceedings of the fourth annual symposium on Computational geometry. New York, NY, USA: ACM, 1988, pp. 134-142.
20. A. Asuncion and D. Newman, "UCI machine learning repository," 2007. [Online]. Available: http://www.ics.uci.edu/~mlearn/MLRepository.html