Abstract
Multi-dimensional Bayesian network classifiers are becoming quite popular for multi-label classification. These models have the advantage of a high expressive power, but may induce a prohibitively high runtime of classification. We argue that the high runtime burden originates from their large treewidth. Thus motivated, we present an algorithm for learning multi-classifiers of small treewidth. Experimental results show that these models have a small runtime of classification, without loosing accuracy compared to unconstrained multi-classifiers.
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
Bartlett, M., Cussens, J.: Advances in Bayesian network learning using integer programming. In: Nicholson, A., Smyth, P. (eds.) Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence, pp. 182–191. AUAI Press (2013)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1), 1–45 (1998)
Bodlaender, H.L., Koster, A.M., Van den Eijkhof, F., Van der Gaag, L.C.: Pre-processing for triangulation of probabilistic networks. In: Breese, J., Koller, D. (eds.) Proceedings of 17th Conference on Uncertainty in Artificial Intelligence, pp. 32–39. Morgan Kaufmann (2001)
Borchani, H., Bielza, C., Larrañaga, P.: Learning CB-decomposable multi-dimensional Bayesian network classifiers. In: Myllymaki, P., Roos, T., Jaakkola, T. (eds.) Proceedings of the 5th European Workshop on Probabilistic Graphical Models. pp. 25–32 (2010)
Buntine, W.: Theory refinement on Bayesian networks. In: Bonissone, P., D’Ambrosio, B., Smets, P. (eds.) Proceedings of the 7th Conference on Uncertainty in Artificial Intelligence, pp. 52–60. Morgan Kaufmann (1991)
de Campos, C.P., Cuccu, M., Corani, G., Zaffalon, M.: Extended tree augmented naive classifier. In: van der Gaag, L.C., Feelders, A.J. (eds.) PGM 2014. LNCS, vol. 8754, pp. 176–189. Springer, Heidelberg (2014)
Corani, G., Antonucci, A., Mauá, D.D., Gabaglio, S.: Trading off speed and accuracy in multilabel classification. In: van der Gaag, L.C., Feelders, A.J. (eds.) PGM 2014. LNCS, vol. 8754, pp. 145–159. Springer, Heidelberg (2014)
Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stan. B 71(4), 233–240 (1967)
Van der Gaag, L.C., De Waal, P.R.: Multi-dimensional Bayesian network classifiers. In: Studeny, M., Vomlel, J. (eds.) Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, pp. 107–114 (2006)
Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. Roy. Stat. Soc. 50(2), 157–224 (1988)
Renooij, S., Van der Gaag, L.C., Parsons, S.: Propagation of multiple observations in QPNs revisited. In: Van Harmelen, F. (ed.) Proceedings of the 15th European Conference on Artificial Intelligence. pp. 665–669 (2002)
Shimony, S.E.: Finding MAPs for belief networks is NP-hard. Artif. Intell. 68(2), 399–410 (1994)
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
Pastink, A., van der Gaag, L.C. (2015). Multi-classifiers of Small Treewidth. 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_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-20807-7_18
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)