Unsupervised anomaly detection in large databases using bayesian networks

Applied Artificial Intelligence

Volumn 22, Issue 4, 2008, Pages 309-330

  Cansado, Antonio ^a   Soto, Alvaro ^a  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; COMPUTATION THEORY; INFORMATION ANALYSIS; STATISTICAL METHODS;

BNAD MANAGES; GAUSSIAN MIXTURE;

DATABASE SYSTEMS;

EID: 42949121951     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839510801972801     Document Type: Article

References (37)

1. Aamodt, A. and E. Plaza. 1994. Case-based reasoning: Foundational issues, methodological variations, and system approaches. Artificial Intelligence Communications 7(1):39-59.
2. Anderson, B. and A. Moore. 1998. AD-trees for fast counting and for fast learning of association rules. In: Proceedings of 4th International Conference on Knowledge Discovery and Data Mining, pp. 134-138.
3. Anderson, B. D. and J. B. Moore. 1979. Optimal Filtering Englewood Cliffs, NJ: Prentice Hall.
4. Anderson, D., T. Frivold, and A. Valdes. 1995. Next-generation intrusion detection expert system (NIDES): A summary. Technical Report SRI-CSL-95-07, Computer Science Laboratory, Menlo Park, CA: SRI International.
5. Bradley, P. S., U. Fayyad, and C. Reina. 1998. Scaling EM (expectation maximization) clustering to large databases. Technical Report MSR-TR-98-35, Redmond, WA: Microsoft Research.
6. Chickering, D. M. 1996a. Learning bayesian networks is NP-complete. In: Learning from Data: Artificial Intelligence and Statistics V, eds. D. H. Fisher and H.-J. Lenz, pp. 121-130, New York, NY: Springer-Verlag.
7. Chickering, D. M. 1996b. Learning equivalence classes of Bayesian network structures. In: Proceedings of 12th Conference on Uncertainty in Artificial Intelligence, pp. 150-157.
8. Chickering, D. M., D. Geiger, and D. Heckerman. 1995. Learning Bayesian networks: Search methods and experimental results. In: Proceedings of 5th Conference on Artificial Intelligence and Statistics, pp. 112-128.
9. Cooper, G. F. and E. Herskovits. 1992. A Bayesian method for the induction of probabilistic networks from data. Machine Learning9(4):309- 347.
10. Cover, T. M. and J. A. Thomas. 1991. Elements of Information Theory New York, NY: John Wiley and Sons, Inc.
11. Dempster, A., N. Laird, and D. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society, Series B 39(1):1-38.
12. Friedman, N. and D. Koller. 2003. Being Bayesian about network structure: A Bayesian approach to structure discovery in bayesian networks. Machine Learning 50(1-2):95-125.
13. Friedman, N., I. Nachman, and D. Peér. 1999. Learning Bayesian network structure from massive datasets: The sparse candidate algorithm. In: Proceedings of 15th Conference on Uncertainty in Artificial Intelligence, pp. 206-215.
14. Heckerman, D. 1996. Bayesian networks for knowledge discovery. In: Advances in Knowledge Discovery and Data Mining, eds. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, pp. 273-305. Cambridge, MA: MIT Press.
15. Hodge, V. J. and J. Austin, 2004. A. survey of outlier detection methodologies. Artificial Intelligence Review 22(2):85-126.
16. Hoeting, J. A., D. Madigan, A. E. Raftery, and G. T. Volinsky. 1999. Bayesian model averaging: A tutorial. Statistical Science 14 (4):382-417.
17. Jackson, P. 1998. Introduction to Expert Systems. Reading, MA: Addison Wesley.
18. Jensen, F. V. 2001. Bayesian Networks and Decision Graphs. New York, NY: Springer-Verlag.
19. Kou, Y., C.-T. Lu, S. Sirwongwattana, and Y.-P. Huang. 2004. Survey of fraud detection techniques. In: Proceedings of the 2004 IEEE International Conference on Networking, Sensing and Control, pp. 749-754.
20. Kullback, S. and R. A. Leibler. 1951. On information and sufficiency. Annals of Mathematical Statistics 22(1):79-86.
21. Larrañaga, P., C. M. Kuijpers, R. H. Murga, and Y. Yurramendi. 1996. Learning Bayesian network structures by searching for the best ordering with genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics 26(4):487-493.
22. Lauritzen, S. L. 1996. Graphical Models. Oxford: Clarendon Press.
23. Lewis, L. M. 1993. A case based reasoning approach to the management of faults in communication networks. In: Proceedings of 12th Annual Joint Conference of the IEEE Computer and Communications Societies. INFOCOM 1993, pp. 1422-1429.
24. Mery, D., R. R. da Silva, L. P. Caloba, and J. M. Rebello. 2003. Pattern recognition in the automatic inspection of aluminium castings. Insight 45(7):431-439.
25. Mitchell, T. 1997. Machine Learning. New York, NY: McGraw Hill.
26. Moore, A. 1999. Very fast EM-based mixture model clustering using multiresolution KD-trees. In: Proceedings of the 11th Conference on Advances in Neural Information Processing Systems, NIPS, pp. 543-549.
27. Moore, A. and W.-K. Wong. 2003. Optimal reinsertion: A new search operator for accelerated and more accurate Bayesian network structure learning. In: Proceedings of 20th International, Conference on Machine, Learning ICML, Menlo Park, CA: AAAI Press, pp. 552-559.
28. Morrison, D. F. 2004. Multivariate, Statistical Methods. Duxbury Advanced Series.
29. Neapolitan, R. E. 2004. Learning Bayesian Networks. Prentice Hall.
30. Parsons, L., E. Haque, and H. Liu. 2004. Subspace clustering for high dimensional data: A review. ACM SIGKDD Explorations Newsletter 6(1):90-105.
31. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann.
32. Scott, D. W. 1992. Multivariate Density Estimation: Theory, Practice, and Visualization. New York, NY: John Wiley and Sons, Inc.
33. Silverman, B. W. 1986. Density Estimation for Statistics and Data Analysis. London, UK: Chapman and Hall.
34. Soto, A., F. Zavala, and A. Araneda. 2007. An accelerated algorithm for density estimation in large databases using Gaussian mixtures. Cybernetics and Systems 38(2):123-139.
35. Spirtes, P., C. Glymour, and R. Scheines. 2000. Causation, Prediction, and Search. Cambridge, MA: The MIT Press.
36. Teyssier, M. and D. Koller. 2005. Ordering-based search: A simple and effective algorithm for learning Bayesian networks. In: Proceedings of 21st Conference on Uncertainty in Artificial Intelligence, pp. 584-590.
37. Zhang, T., R. Ramakrishnan, and M. Livny. 1996. Birch: An efficient data clustering method for very large databases. In: Proceedings of the 1996 ACM SIG MOD International Conference on Management of Data, pp. 103-114.