Mining top-n local outliers in large databases

Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2001, Pages 293-298

  Jin, Wen ^a   Tung, Anthony K H ^a   Han, Jiawei ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

LOCAL OUTLIERS;

DATA MINING;

EID: 0035788909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502512.502554     Document Type: Conference Paper

References (10)

1. V. Barnett and T. Lewis. Outliers in Statistical Data. John Wiley & Sons, 1994.
2. S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: An efficient and robust access method for points and rectangles. In Proc. 1996 Int. Conf. Very Large Data Bases (VLDB'96), pages 28-39, Bombay, India, Sept. 1996.
3. M. M. Breunig, H. P. Kriegel, R. T. Ng, and J. Sander. Lof: Identifying density-based local outliers. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), Dallas, Texas, 2000.
4. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96), pages 226-231, Portland, Oregon, Aug. 1996.
5. S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), pages 73-84, Seattle, WA, June 1998.
6. D. Hawkins, Identification of Outliers. Chapman and Hall, London, 1980.
7. E. Knorr and R. Ng. Algorithms for mining distance-based outliers in large datasets. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB'98), pages 392-403, New York, NY, Aug. 1998.
8. R. Ng and J. Han. Efficient and effective clustering method for spatial data mining. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), pages 144-155, Santiago, Chile, Sept. 1994.
9. S. Ramaswamy, R. Rastogi, and K. Shim. Efficient algorithms for mining outliers from large data sets. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), Dallas, Texas, 2000.
10. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96), pages 103-114, Montreal, Canada, June 1996.