Abstract
In this work, we tackle the problem of structure learning for Bayesian network classifiers (BNC). Searching for an appropriate structure is a challenging task since the number of possible structures grows exponentially with the number of attributes. We formulate this search problem as a large Markov Decision Process (MDP). This allows us to tackle the problem using sequential decision making methods. Furthermore, we devise a Monte Carlo tree search algorithm to find a tractable solution for the MDP. The use of bandit-based action selection strategy enables us to have a systematic way of guiding the search, making the search in the large space of unrestricted structures tractable. The results of classification on different datasets show that the use of this method can significantly boost the performance of structure learning for BNCs.
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
Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2), 235–256 (2002)
Carvalho, A.M., Roos, T.T., Oliveira, A.L., Myllymäki, P., et al.: Discriminative learning of bayesian networks via factorized conditional log-likelihood. Journal of Machine Learning Research (2011)
Fayyad, U., Irani, K.: Multi-interval discretization of continuous-valued attributes for classification learning (1993)
Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian network classifiers. Machine Learning 29(2), 131–163 (1997)
Gaudel, R., Sebag, M., et al.: Feature selection as a one-player game (2010)
Gelly, S., Wang, Y.: Exploration exploitation in go: Uct for monte-carlo go. In: Twentieth Annual Conference on Neural Information Processing Systems (NIPS) (2006)
Greiner, R., Su, X., Shen, B., Zhou, W.: Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers. Machine Learning 59(3), 297–322 (2005)
Grossman, D., Domingos, P.: Learning bayesian network classifiers by maximizing conditional likelihood. In: Proceedings of the Twenty-First International Conference on Machine Learning (2004)
Keogh, E., Pazzani, M.: Learning augmented bayesian classifiers: A comparison of distribution-based and classification-based approaches. In: Proceedings of the Seventh International Workshop on Artificial Intelligence and Statistics, pp. 225–230. Citeseer (1999)
Kocsis, L., Szepesvári, C.: Bandit Based Monte-Carlo Planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)
Larranaga, P., Poza, M., Yurramendi, Y., Murga, R.H., Kuijpers, C.M.H.: Structure learning of bayesian networks by genetic algorithms: A performance analysis of control parameters. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(9), 912–926 (2002)
Pernkopf, F., Wohlmayr, M., Tschiatschek, S.: Maximum margin bayesian network classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence (2012)
Su, J., Zhang, H., Ling, C.X., Matwin, S.: Discriminative parameter learning for bayesian networks. In: Proceedings of the 25th International Conference on Machine Learning, pp. 1016–1023 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eghbali, S., Ashtiani, M.H.Z., Ahmadabadi, M.N., Araabi, B.N. (2012). Bandit-Based Structure Learning for Bayesian Network Classifiers. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34481-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-34481-7_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34480-0
Online ISBN: 978-3-642-34481-7
eBook Packages: Computer ScienceComputer Science (R0)