An Improved Lower Bound for Bayesian Network Structure Learning

Several heuristic search algorithms such as A* and breadth-first branch and bound have been developed for learning Bayesian network structures that optimize a scoring function. These algorithms rely on a lower bound function called static k-cycle conflict heuristic in guiding the search to explore the most promising search spaces. The heuristic takes as input a partition of the random variables of a data set; the importance of the partition opens up opportunities for further research. This work introduces a new partition method based on information extracted from the potentially optimal parent sets (POPS) of the variables. Empirical results show that the new partition can significantly improve the efficiency and scalability of heuristic search-based structure learning algorithms.

[1]  Changhe Yuan,et al.  Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks , 2013, UAI.

[2]  Qiang Ji,et al.  Efficient Structure Learning of Bayesian Networks using Constraints , 2011, J. Mach. Learn. Res..

[3]  David Heckerman,et al.  A Tutorial on Learning with Bayesian Networks , 1998, Learning in Graphical Models.

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

[5]  Changhe Yuan,et al.  Learning Optimal Bayesian Networks: A Shortest Path Perspective , 2013, J. Artif. Intell. Res..

[6]  Changhe Yuan,et al.  Finding Optimal Bayesian Network Structures with Constraints Learned from Data , 2014, UAI.

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

[8]  Andrew W. Moore,et al.  Finding optimal Bayesian networks by dynamic programming , 2005 .

[9]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[10]  Changhe Yuan,et al.  Tightening Bounds for Bayesian Network Structure Learning , 2014, AAAI.

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

[12]  Mikko Koivisto,et al.  Exact Bayesian Structure Discovery in Bayesian Networks , 2004, J. Mach. Learn. Res..

[13]  Changhe Yuan,et al.  Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search , 2011, UAI.

[14]  Constantin F. Aliferis,et al.  The max-min hill-climbing Bayesian network structure learning algorithm , 2006, Machine Learning.

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

[16]  Satoru Miyano,et al.  Finding Optimal Models for Small Gene Networks , 2003 .

[17]  Wai Lam,et al.  LEARNING BAYESIAN BELIEF NETWORKS: AN APPROACH BASED ON THE MDL PRINCIPLE , 1994, Comput. Intell..

[18]  Wray L. Buntine.  Theory Refinement on Bayesian Networks , 1991, UAI.

[19]  Changhe Yuan,et al.  An Improved Admissible Heuristic for Learning Optimal Bayesian Networks , 2012, UAI.

[20]  Changhe Yuan,et al.  Memory-Efficient Dynamic Programming for Learning Optimal Bayesian Networks , 2011, AAAI.

[21]  Changhe Yuan,et al.  Learning Optimal Bayesian Networks Using A* Search , 2011, IJCAI.

[22]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[23]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .