Enhancing effectiveness of Outlier detections for low Density Patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2336, Issue , 2002, Pages 535-548

  Tang, Jian ^a   Chen, Zhixiang ^b   Fu, Ada Wai Chee ^a   Cheung, David W ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ANOMALY DETECTION; CRIME; INTRUSION DETECTION; STATISTICS;

CREDIT CARD FRAUD DETECTIONS; EMPIRICAL ANALYSIS; LOCAL OUTLIER FACTORS; LOW DENSITY; NEIGHBOURHOOD;

DATA MINING;

EID: 84945281435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47887-6_53     Document Type: Conference Paper

References (16)

1. A. Arning, R. Agrawal, P.R aghavan: ”A Linear Method for Deviation detection in Large Databases”, Proc. of 2nd Intl. Conf. On Knowledge Discovery and Data Mining, 1996, pp 164-169.
2. V. Barnett, T. Lewis: ”Outliers in Statistical Data”, John Wiley, 1994.
3. M. Breuning, Hans-Peter Kriegel, R. Ng, J. Sander: ”LOF: Identifying density based Local Outliers”, Proc. of the ACM SIGMOD Conf. On Management of Data, 2000.
4. W. Du Mouchel, M. Schonlau: ”A Fast Computer Intrusion Detection Algorithm based on Hypothesis Testing of Command Transition Probabilities”, Proc.of 4th Intl.Conf. On Knowledge Discovery and Data Mining, 1998, pp. 189-193.
5. M. Ester, H. Kriegel, J. Sander, X. Xu: ”A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, Proc. of 2nd Intl. Conf. On Knowledge Discovery and Data Mining, 1996, pp 226-231.
6. T. Fawcett, F. Provost: ”Adaptive Fraud Detection”, Data Mining and Knowledge Discovery Journal, Kluwer Academic Publishers, Vol.1, No.3, 1997, pp 291-316.
7. D. Hawkins: ”Identification of Outliers”, Chapman and Hall, London, 1980.
8. E. Knorr, R. Ng: ”Algorithms for Mining Distance based Outliers in Large Datasets”, Proc. of 24th Intl. Conf. On Very Large Data Bases, 1998, pp 392-403.
9. E. Knorr, R. Ng: ”Finding Intensional Knowledge of Distance-based Outliers”, Proc. of 25th Intl. Conf. On Very Large Data Bases, 1999, pp 211-222.
10. R. Ng, J. Han: ”Efficient and Effective Clustering Methods for Spatial Data Mining”, Proc. of 20th Intl. Conf. On Very Large Data Bases, 1994, pp 144-155.
11. S. Ramaswamy, R. Rastogi, S. Kyuseok: ”Efficient Algorithms for Mining Outliers from Large Data Sets”, Proc. of ACM SIGMOD Intl. Conf. On Management of Data, 2000, pp 427-438.
12. N. Roussopoulos, S. Kelley, F. Vincent, ”Nearest Neighbor Queries”, Proc. of ACM SIGMOD Intl. Conf. On Management of Data, 1995, pp 71-79.
13. G. Sheikholeslami, S. Chatterjee, A. Zhang: ”Wave Cluster: A multi-Resolution Clustering Approach for Very Large Spatial Databases”, Proc. of 24th Intl. Conf. On Very Large Data Bases, 1998, pp 428-439.
14. S. Guha, R. Rastogi, K.S him: ”Cure: An Efficient Clustering Algorithm for Large Databases”, In Proc. of the ACM SIGMOD Conf. On Management of Data, 1998, pp 73-84.
15. J. Tang, Z. Chen, A. Fu and D. Cheung: ”A General Framework for Outlier Formulations: Density versus Connectivity”, Manuscript.
16. T. Zhang, R. Ramakrishnan, M. Linvy: ”BIRCH: An Efficient Data Clustering Method for Very Large Databases”, Proc. of ACM SIGMOD Intl. Conf. On Management of Data, 1996, pp 103-114.