Abstract
Context specific independence (CSI) is an efficient means to capture independencies that hold only in certain contexts. Inference algorithms based on CSI are capable to learn the Conditional Probability Distribution (CPD) tree relative to a target variable. We model motifs as specific contexts that are recurrently observed in data. These motifs can thus constitute a domain knowledge which can be incorporated into a learning procedure. We show that the integration of this prior knowledge provides better learning performances and facilitates the interpretation of local structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boutilier, C., Friedman, N., Goldszmidt, M., Koller, D.: Context-specific independence in Bayesian networks. pp. 115–123 (1996)
Friedman, N., Goldzsmidt, M.: Learning Bayesian networks with local structure. In: Learning in Graphical Models, pp. 252–262. MIT Press (1996)
Cano, A., Gómez-Olmedo, M., Moral, S., Pérez-Ariza, C.B.: Recursive probability trees for Bayesian Networks. In: Meseguer, P., Mandow, L., Gasca, R.M. (eds.) CAEPIA 2009. LNCS, vol. 5988, pp. 242–251. Springer, Heidelberg (2010)
Fenz, S., Tjoa, A.M., Hudec, M.: Ontology-based generation of Bayesian networks. In: Barolli, L., Xhafa, F., Hsu, H.-H. (eds.) CISIS, pp. 712–717. IEEE Computer Society, Washington, D.C (2009)
Neil, M., Fenton, N., Nielson, L.: Building large-scale Bayesian networks. Knowl. Eng. Rev. 15, 257–284 (2000)
Ben Messaoud, M., Leray, P., Ben Amor, N.: A Serendipitous strategy for learning causal Bayesian Networks using ontologies. In: Liu, W. (ed.) ECSQARU 2011. LNCS, vol. 6717, pp. 182–193. Springer, Heidelberg (2011)
Eugene Jr., S., Qi, G., Eunice, E.S.: Bayesian knowledge base tuning. Int. J. Approximate Reasoning 54(8), 1000–1012 (2013)
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)
Quinlan, J.R., Rivest, R.L.: Inferring decision trees using the minimum description length principle. Inf. Comput. 80(3), 227–248 (1989)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Acknowledgments
This work was supported by the GRIOTE Bioinformatics Research Project of Pays de la Loire Region, France.
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
Ramstein, G., Leray, P. (2015). CPD Tree Learning Using Contexts as Background Knowledge. In: Destercke, S., Denoeux, T. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2015. Lecture Notes in Computer Science(), vol 9161. Springer, Cham. https://doi.org/10.1007/978-3-319-20807-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-20807-7_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20806-0
Online ISBN: 978-3-319-20807-7
eBook Packages: Computer ScienceComputer Science (R0)