Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure

We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-structure. The previously derived constrained optimal search (COS) remains limited even for sparse superstructures. To extend its feasibility, we propose to divide the super-structure into several clusters and perform an optimal search on each of them. Further, to ensure acyclicity, we introduce the concept of ancestral constraints (ACs) and derive an optimal algorithm satisfying a given set of ACs. Finally, we theoretically derive the necessary and sufficient sets of ACs to be considered for finding an optimal constrained graph. Empirical evaluations demonstrate that our algorithm can learn optimal Bayesian networks for some graphs containing several hundreds of vertices, and even for super-structures having a high average degree (up to four), which is a drastic improvement in feasibility over the previous opt...

• Type: Journal
• Year: 2010
• Where: JMLR
• Authors: Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru Miyano
• Keywords: JMLR 2010, Optimal Algorithm, Optimal Bayesian Networks, Optimal Search