Abstract
This work is focused on learning maximum weighted graphs subject to three structural constraints: (1) the graph is decomposable, (2) it has a maximum clique size of k + 1, and (3) it is coarser than a given maximum k-order decomposable graph. After proving that the problem is NP-hard we give a formulation of the problem based on integer linear programming. The approach has shown competitive experimental results in artificial domains. The proposed formulation has important applications in the field of probabilistic graphical models, such as learning decomposable models based on decomposable scores (e.g. log-likelihood, BDe, MDL, just to name a few).
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
Boundy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press LTD (1976)
Chow, C.K., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory 14, 462–467 (1968)
Desphande, A., Garofalakis, M., Jordan, M.I.: Efficient stepwise selection in decomposable models. In: Proceedings of UAI, pp. 128–135 (2001)
Koller, D., Friedman, N.: Probabilistic Graphical Models. Principles and Techniques. The MIT Press, Cambridge (2009)
Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1), 48–50 (1968)
Lauritzen, S.L.: Graphical Models. Oxford University Press, New York (1996)
Malvestuto, F.M.: Approximating discrete probability distributions with decomposable models. IEEE Trans on SMC 21(5), 1287–1294 (1991)
Pérez, A., Inza, I., Lozano, J.A.: Efficient learning of decomposable models with a bounded clique size. Technical Report, University of the Basque Country, EHU-KZAA-TR-2014-07 (2014)
Srebro, N.: Maximum likelihood markov networks: An algorithmic approach. Master thesis, MIT (2000)
Srebro, N.: Maximum likelihood bounded tree-width Markov networks. Artificial Intelligence 143, 123–138 (2003)
Vats, D., Robert, R.N.: A junction tree framework for undirected graphical model selection. Journal of Machine Learning Research 15, 147–191 (2014)
IBM ILOG CPLEX VI2.1: User’s Manual for CPLEX, International Business Machines Corporation (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Pérez, A., Blum, C., Lozano, J.A. (2014). Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming. In: van der Gaag, L.C., Feelders, A.J. (eds) Probabilistic Graphical Models. PGM 2014. Lecture Notes in Computer Science(), vol 8754. Springer, Cham. https://doi.org/10.1007/978-3-319-11433-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-11433-0_26
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11432-3
Online ISBN: 978-3-319-11433-0
eBook Packages: Computer ScienceComputer Science (R0)