Abstract
Causal nets (Pearl 1986) are an elegant way of representing the structure and relationships of a set of data. The propagation of changes through the net has been examined and reported on in many works (Pearl 1986, Lauritzen & Speigelhalter 1988, Neapolitan 1990). Causal nets are defined by the properties of conditional independence, and so the structure of the net may be obtained by discovering conditional independences. Many of the examples in the literature test for complete equality. However, the presence of noise and the unreliability of comparing two real numbers means that equality is taken to mean equality within a particular tolerance. Where a set of data contains a number of representative subsets this tolerance can be almost zero. If there is an incomplete subset in the data and conjoint events then the tolerance cannot be zero. The paper presents a method for estimating the size of the partial cohort, the size of the representative cohorts and thus provides a robust test for conditional independence.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baldwin, J.F., Martin, T.P. & Pilsworth B.W., 1995, Fril-Fuzzy and Evidential Reasoning, Research Studies Press, Wiley.
Ben Amor, N., Benferhat, S., Dubois, D., Geffner, H. & Prade, H., 2000, Independence in qualitative uncertainty frameworks, Proc. KR2000 pp. 235–246.
Clocksin, W.F. & Mellish, C.S., 1981, Programming in PROLOG, Springer-Verlag.
Dubois, D. Farinas del Cerro, L., Herzig, A. and Prade, H., 1997, Qualitative Relevance and Independence: A Roadmap, in Proc. IJCAI pp. 62–67.
Kowalski, R.A., 1980, Logic for Problem solving, North-Holland.
Lauritzen, S.L. & Speigelhalter, D.J., 1988, Local Computation with probabilities in Graphical Structures and Their Applications to Expert Systems, Journal of the Royal Statistical Society B, Vol 50, No. 2.
Lauritzen, S.L. (1996). Graphical models. Oxford University Press, London. ISBN 0-19-852219-3
Neapolitan, R.E., 1990, Probabilistic Reasoning in Expert Systems:Theory and Algorithms, Wiley.
Pearl, J., 1986, Fusion, Propagation and structuring in Belief Networks, Artificial Intelligence 29 pp. 217–222.
Poole, D., 1993, Probabilistic Horn abduction and Bayesian networks, Artificial Intelligence 64 pp. 81–130.
Reiter, R. 1978, On closed world databases, in ed Gallaire, H. & Minker, J. Logic and Data Bases, Plenum Press New York, pp 55–76.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hinde, C.J. (2003). Extracting Causal Nets from Databases. In: Chung, P.W.H., Hinde, C., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2003. Lecture Notes in Computer Science(), vol 2718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45034-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-45034-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40455-2
Online ISBN: 978-3-540-45034-4
eBook Packages: Springer Book Archive