Abstract
Understanding the knowledge that resides in a Bayesian network can be hard, certainly when a large network is to be used for the first time, or when the network is complex or has just been updated. Tools to assist users in the analysis of Bayesian networks can help. In this paper, we introduce a novel general framework and tool for answering exploratory queries over Bayesian networks. The framework is inspired by queries from the constraint-based mining literature designed for the exploratory analysis of data. Adapted to Bayesian networks, these queries specify a set of constraints on explanations of interest, where an explanation is an assignment to a subset of variables in a network. Characteristic for the methodology is that it searches over different subsets of the explanations, corresponding to different marginalizations. A general purpose framework, based on principles of constraint programming, data mining and knowledge compilation, is used to answer all possible queries. This CP4BN framework employs a rich set of constraints and is able to emulate a range of existing queries from both the Bayesian network and the constraint-based data mining literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
- 2.
- 3.
available at http://www.bnlearn.com/bnrepository/.
References
Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) SIGMOD Conference, pp. 207–216. ACM Press (1993)
Binder, J., Koller, D., Russell, S.J., Kanazawa, K.: Adaptive probabilistic networks with hidden variables. Mach. Learn. 29(2–3), 213–244 (1997)
Boulicaut, J.-F., Jeudy, B.: Mining free itemsets under constraints. In: Proceeding IDEAS 2001, pp. 322–329. IEEE Computer Society (2001)
Chen, S.J., Choi, A., Darwiche, A.: Algorithms and applications for the same-decision probability. J. Artif. Intell. Res. 49, 601–633 (2014)
Darwiche, A.: A differential approach to inference in Bayesian networks. J. ACM 50(3), 280–305 (2003)
de Campos, L.M., Gámez, J.A., Moral, S.: Simplifying explanations in Bayesian belief networks. Int. J. Uncertainty Fuzziness Knowl. Based Syst. 9(4), 461–490 (2001)
Druzdzel, M.J., Suermondt, H.J.: Relevance in probabilistic models: “backyards” in a “small world”. In: Working notes of the AAAI-1994 Fall Symposium Series: Relevance, pp. 60–63 (1994)
Fauré, C., Delprat, S., Boulicaut, J.-F., Mille, A.: Iterative Bayesian network implementation by using annotated association rules. In: Staab, S., Svátek, V. (eds.) EKAW 2006. LNCS (LNAI), vol. 4248, pp. 326–333. Springer, Heidelberg (2006)
Guns, T., Nijssen, S., De Raedt, L.: Itemset mining: a constraint programming perspective. Artif. Intell. 175(12–13), 1951–1983 (2011)
Jaroszewicz, S., Scheffer, T., Simovici, D.A.: Scalable pattern mining with Bayesian networks as background knowledge. Data Min. Knowl. Discov. 18(1), 56–100 (2009)
Kwisthout, J.: Most Inforbable explanations: finding explanations in Bayesian networks that are both probable and informative. In: van der Gaag, L.C. (ed.) ECSQARU 2013. LNCS, vol. 7958, pp. 328–339. Springer, Heidelberg (2013)
Malhas, R., Aghbari, Z.A.: Interestingness filtering engine: mining Bayesian networks for interesting patterns. Expert Syst. Appl. 36(3), 5137–5145 (2009)
Mateescu, R., Dechter, R.: Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1–3), 3–51 (2008)
Nijssen, S., Zimmermann, A.: Constraint-based pattern mining. In: Aggarwal, C.C., Han, J. (eds.) Frequent Pattern Mining, pp. 147–163. Springer, Switzerland (2014)
Przytula, K.W., Dash, D., Thompson, D.: Evaluation of Bayesian networks used for diagnostics, vol. 60 pp. 1–12 (2003)
Rietbergen, M.T., van der Gaag, L.C., Bodlaender, H.L.: Provisional propagation for verifying monotonicity of Bayesian networks. ECAI 263, 759–764 (2014)
Rossi, F., van Beek, P., Walsh, T.: Handbook of constraint programming. Elsevier (2006)
Solomon Eyal Shimony: The role of relevance in explanation I: irrelevance as statistical independence. Int. J. Approx. Reasoning 8(4), 281–324 (1993)
Yuan, C., Lim, H., Tsai-Ching, L.: Most relevant explanation in Bayesian networks. J. Artif. Intell. Res. (JAIR) 42, 309–352 (2011)
Acknowledgment
This work was supported by the European Commission under the project“Inductive Constraint Programming” contract number FP7-284715 and by the Research Foundation–Flanders by means of two Postdoc grants
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Babaki, B., Guns, T., Nijssen, S., De Raedt, L. (2015). Constraint-Based Querying for Bayesian Network Exploration. In: Fromont, E., De Bie, T., van Leeuwen, M. (eds) Advances in Intelligent Data Analysis XIV. IDA 2015. Lecture Notes in Computer Science(), vol 9385. Springer, Cham. https://doi.org/10.1007/978-3-319-24465-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-24465-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24464-8
Online ISBN: 978-3-319-24465-5
eBook Packages: Computer ScienceComputer Science (R0)