Abstract
The paper describes the causal law mining from an incomplete database. First we extend the definition of association rules in order to deal with uncertain attribute values in records. As Agrawal’s well-know algorithm generates too many irrelevant association rules, a filtering technique based on minimal AIC principle is applied here. The graphic representation of association rules validated by a filter may have directed cycles. The authors propose a method to exclude useless rules with a stochastic test, and to construct Bayesian networks from the remaining rules. Finally, a schem for Causal Law Mining is proposed as an integration of the techniques described in the paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. proceedings of the ACM SIGMOD Conference on Management of Data, 1993.
R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. IBM Research Report RJ9839, June 1993, IBM Almaden Research Center, San Jose, Calif..
K. Matsumoto and K. Hashimoto. Association Rule Filter for Data Mining in Call Tracking Data. IEICE Transactions on Communication, E81-B, No. 12, pp. 2481–2486, 1998.
H. Akaike. A New Look at the Statistical Model Identification. IEEE Transactions on Automatic Control, 19:716–723, 1974.
R. Zembowicz and J. M. Żytkow. Testing the existence of Functional Relationships in Data. AAAI Workshop on Knowledge Discovery in Database, 1993.
D. Heckerman, D. Geiger, and D. Chickering. Learning Bayesian Networks: The Combination of Knowledge and Statistical Data. Machine Learning, 1995.
W. Lam and F. Bacchaus. Learning Bayesian belief networks: An approach based on the MDL principle. em Computational Intelligence, 10:269–293, 1994.
D._M. Chickering. Learning Baysean network is NP-complete. in Learning from Data: Artificial Intelligence and Statistics V, Springer Verlag, 1996.
N. Friedman and M. Goldszmidt. Learning Baysean Networks with Local Strucures. in Learning in Graphical Models, MIT Press, 1999.
J. Rissanen. Modeling by shortest data description. In Automatica, 14:465–471, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsumoto, K., Hashimoto, K. (1999). Schema Design for Causal Law Mining from Incomplete Database. In: Arikawa, S., Furukawa, K. (eds) Discovery Science. DS 1999. Lecture Notes in Computer Science(), vol 1721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46846-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-46846-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66713-1
Online ISBN: 978-3-540-46846-2
eBook Packages: Springer Book Archive