A linear method for deviation detection in large databases

作者: Prabhakar Raghavan , Andreas Arning , Rakesh Agrawal

DOI:

关键词:

摘要: We describe the problem of finding deviations in large data bases. Normally, explicit information outside data, like integrity constraints or predefined patterns, is used for deviation detection. In contrast, we approach from inside using implicit redundancy data. We give a formal description and present linear algorithm detecting deviations. Our solution simulates mechanism familiar to human beings: after seeing series similar an element disturbing considered exception. also experimental results application this on real-life datasets showing its effectiveness.

参考文章(20)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
Ryszard S. Michalski, Robert E. Stepp, Learning from Observation: Conceptual Clustering Machine Learning. pp. 331- 363 ,(1983) , 10.1007/978-3-662-12405-5_11
J. G. Carbonell, T. M. Mitchell, R. S. Michalski, Machine Learning: An Artificial Intelligence Approach Springer Publishing Company, Incorporated. ,(2013)
L. G. Valiant, A theory of the learnable symposium on the theory of computing. ,vol. 27, pp. 1134- 1142 ,(1984) , 10.1145/800057.808710
David E. Rumelhart, David Zipser, Feature Discovery by Competitive Learning. Cognitive Science. ,vol. 9, pp. 75- 112 ,(1985) , 10.1016/S0364-0213(85)80010-0