Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number

Both learning and inference tasks on Bayesian networks are NP-hard in general. Bounded tree-width Bayesian networks have recently received a lot of attention as a way to circumvent this complexity issue; however, while inference on bounded tree-width networks is tractable, the learning problem remains NP-hard even for tree-width 2. In this paper, we propose bounded vertex cover number Bayesian networks as an alternative to bounded tree-width networks. In particular, we show that both inference and learning can be done in polynomial time for any fixed vertex cover number bound k, in contrast to the general and bounded tree-width cases; on the other hand, we also show that learning problem is W[1]-hard in parameter k. Furthermore, we give an alternative way to learn bounded vertex cover number Bayesian networks using integer linear programming (ILP), and show this is feasible in practice.

[1]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[2]  C. N. Liu,et al.  Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.

[3]  Richard E. Neapolitan,et al.  Learning Bayesian networks , 2007, KDD '07.

[4]  Qiang Ji,et al.  Advances in Learning Bayesian Networks of Bounded Treewidth , 2014, NIPS.

[5]  James Cussens,et al.  Bayesian network learning with cutting planes , 2011, UAI.

[6]  Sanjoy Dasgupta,et al.  Learning Polytrees , 1999, UAI.

[7]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[8]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[9]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[10]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[11]  David Maxwell Chickering,et al.  Large-Sample Learning of Bayesian Networks is NP-Hard , 2002, J. Mach. Learn. Res..

[12]  Yijia Chen,et al.  Bounded nondeterminism and alternation in parameterized complexity theory , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[13]  Jens Lagergren,et al.  Learning Bounded Tree-width Bayesian Networks using Integer Linear Programming , 2014, AISTATS.

[14]  David Maxwell Chickering,et al.  Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.

[15]  Janne H. Korhonen,et al.  Exact Learning of Bounded Tree-width Bayesian Networks , 2013, AISTATS.

[16]  Johan Kwisthout,et al.  The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks , 2010, ECAI.

[17]  Brandon M. Malone,et al.  Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability , 2014, AISTATS.

[18]  David Maxwell Chickering,et al.  Learning Bayesian Networks is , 1994 .

[19]  S. Miyano,et al.  Finding optimal gene networks using biological constraints. , 2003, Genome informatics. International Conference on Genome Informatics.

[20]  Stephen Gould,et al.  Learning Bounded Treewidth Bayesian Networks , 2008, NIPS.

[21]  James Cussens,et al.  Advances in Bayesian Network Learning using Integer Programming , 2013, UAI.

[22]  Gregory F. Cooper,et al.  A Bayesian method for the induction of probabilistic networks from data , 1992, Machine-mediated learning.

[23]  Tomi Silander,et al.  A Simple Approach for Finding the Globally Optimal Bayesian Network Structure , 2006, UAI.

[24]  Tommi S. Jaakkola,et al.  Learning Bayesian Network Structure using LP Relaxations , 2010, AISTATS.

[25]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[26]  Christopher Meek,et al.  Finding a path is harder than finding a tree , 2001, AISTATS.