Abstract
Optimal search on Bayesian network structure is known as an NP-hard problem and the applicability of existing optimal algorithms is limited in small Bayesian networks with 30 nodes or so. To learn larger Bayesian networks from observational data, some heuristic algorithms were used, but only a local optimal structure is found and its accuracy is not high in many cases. In this paper, we review optimal search algorithms in a constraint search space; The skeleton of the learned Bayesian network is a sub-graph of the given undirected graph called super-structure. The introduced optimal search algorithm can learn Bayesian networks with several hundreds of nodes when the degree of super-structure is around four. Numerical experiments indicate that constraint optimal search outperforms state-of-the-art heuristic algorithms in terms of accuracy, even if the super-structure is also learned by data.
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
Preview
Unable to display preview. Download preview PDF.
References
Friedman, N., Linial, M., Nachman, I., Peér, D.: Using Bayesian network to analyze expression data. J. Comp. Biol. 7, 601–620 (2000)
Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning 20, 197–243 (1995)
Imoto, S., Goto, T., Miyano, S.: Estimation of genetic networks and functional structures between genes by using Bayesian network and nonparametric regression. In: Pacific Symposium on Biocomputing, vol. 7, pp. 175–186 (2002)
Koivisto, M., Sood, K.: Exact Bayesian structure discovery in Bayesian networks. Journal of Machine Learning Research 5, 549–573 (2004)
Kojima, K., Perrier, E., Imoto, S., Miyano, S.: Optimal search on clustered structural constraint for learning Bayesian network structure. Journal of Machine Learning Research 11, 285–310 (2010)
Ott, S., Imoto, S., Miyano, S.: Finding optimal models for small gene networks. In: Pacific Symposium on Biocomputing, vol. 9, pp. 557–567 (2004)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman Publishers, San Mateo (1988)
Parviainen, P., Koivisto, M.: Exact structure discovery in Bayesian networks with less space. In: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (2009)
Perrier, E., Imoto, S., Miyano, S.: Finding optimal Bayesian network given a super-structure. Journal of Machine Learning Research 9, 2251–2286 (2008)
Silander, T., Myllymaki, P.: A simple approach for finding the globally optimal Bayesian network structure. In: Conference on Uncertainty in Artificial Intelligence, pp. 445–452 (2006)
Singh, A.P., Moore, A.W.: Finding optimal Bayesian networks by dynamic programming. In: Technical report, Carnegie Mellon University (2005)
Tamada, Y., Imoto, S., Miyano, S.: Parallel algorithm for learning optimal Bayesian network structure (submitted for publication)
Tsamardinos, I., Brown, L.E., Aliferis, C.F.: The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning 65, 31–78 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imoto, S., Kojima, K., Perrier, E., Tamada, Y., Miyano, S. (2011). Searching Optimal Bayesian Network Structure on Constraint Search Space: Super-Structure Approach. In: Onada, T., Bekki, D., McCready, E. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2010. Lecture Notes in Computer Science(), vol 6797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25655-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-25655-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25654-7
Online ISBN: 978-3-642-25655-4
eBook Packages: Computer ScienceComputer Science (R0)