Fast and reliable anomaly detection in categorical data

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 415-424

  Akoglu, Leman ^a   Tong, Hanghang ^b   Vreeken, Jilles ^c   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

anomaly detection; categorical data; data encoding

Indexed keywords

ANOMALY DETECTION; CATEGORICAL DATA; COMPREX; DATA ENCODING; DATA SETS; DATABASE SIZE; DISTANCE FUNCTIONS; KEY FEATURE; NUMERICAL FEATURES; RELATIONAL DATABASE; RUNNING TIME; SIMILARITY THRESHOLD;

HEALTH CARE; KNOWLEDGE MANAGEMENT;

DATABASE SYSTEMS;

EID: 84871074681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396816     Document Type: Conference Paper

References (26)

1. C. C. Aggarwal and P. S. Yu. Outlier detection for high dimensional data. In SIGMOD, 2001.
2. L. Akoglu, M. McGlohon, and C. Faloutsos. Oddball: Spotting anomalies in weighted graphs. In PAKDD, 2010.
3. A. Arning, R. Agrawal, and P. Raghavan. A linear method for deviation detection in large databases. In KDD, 1996.
4. M. M. Breunig, H. Kriegel, R. T. Ng, and J. Sander. LOF: Identifying density-based local outliers. In SIGMOD, 2000.
5. A. Bronstein, J. Das, M. Duro, R. Friedrich, G. Kleyner, M. Mueller, S. Singhal, and I. Cohen. Using bayes-nets for detecting anomalies in Internet services. In INM, 2001.
6. V. Chandola, A. Banerjee, and V. Kumar. Anomaly detection for discrete sequences: A survey. IEEE Trans. Knowl. Data Eng., 24(5):823-839, 2012.
7. A. Chaudhary, A. S. Szalay, and A. W. Moore. Very fast outlier detection in large multidimensional data sets. In DMKD, 2002.
8. K. Das and J. G. Schneider. Detecting anomalous records in categorical datasets. In KDD, 2007.
9. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In DS, pages 278-289, 2004.
10. A. Ghoting, S. Parthasarathy, and M. E. Otey. Fast mining of distance-based outliers in high-dimensional datasets. Data Min. Knowl. Discov., 16(3):349-364, 2008.
11. G. Grimmett and D. Stirzaker. Probability and Random Processes. Oxford University Press, 2001.
12. P. Grünwald. The Minimum Description Length Principle. MIT Press, 2007.
13. D. Hawkins. Identification of outliers. Chapman and Hall, 1980.
14. P. Kontkanen and P. Myllymäki. MDL histogram density estimation. In AISTAT, 2007.
15. K.-N. Kontonasios and T. De Bie. An information-theoretic approach to finding noisy tiles in binary databases. In SDM, 2010.
16. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer, 1993.
17. J. Lin, E. J. Keogh, S. Lonardi, and B. Y. Chiu. A symbolic representation of time series, with implications for streaming algorithms. In DMKD, pages 2-11, 2003.
18. M. Mampaey and J. Vreeken. Summarising categorical data by clustering attributes. Data Min. Knowl. Disc., 2012.
19. P. Miettinen, T. Mielikäinen, A. Gionis, G. Das, and H. Mannila. The discrete basis problem. IEEE TKDE, 20(10):1348-1362, 2008.
20. J. Rissanen. Modeling by shortest data description. Automatica, 14(1):465-471, 1978.
21. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In SDM, pages 393-404. SIAM, 2006.
22. K. Smets and J. Vreeken. The odd one out: Identifying and characterising anomalies. In SDM, pages x-y. SIAM, 2011.
23. K. Smets and J. Vreeken. SLIM: Directly mining descriptive patterns. In SDM, pages 1-12. SIAM, 2012.
24. N. Tatti and J. Vreeken. Finding good itemsets by packing data. In ICDM, pages 588-597, 2008.
25. J. Vreeken, M. van Leeuwen, and A. Siebes. KRIMP: Mining itemsets that compress. DAMI, 23(1):169-214, 2011.
26. W.-K. Wong, A. W. Moore, G. F. Cooper, and M. M. Wagner. Bayesian network anomaly pattern detection for disease outbreaks. In ICML, 2003.