Recovering the Global Structure from Multiple Local Bayesian Networks

Bayesian networks are powerful tools for common knowledge representation and reasoning of partial beliefs under uncertainty. In the last decade, Bayesian networks have been successfully applied to a variety of problem domains and many Bayesian networks have been established. Confronted with many real-world applications, each Bayesian network established may be a local model of the whole knowledge domain. It is desirable to combine all local models of the whole domain into a global and more general representation. It is not realistic to expect the domain experts to construct the global model manually due to the too broad domain. As well, it is not feasible to relearn the model since the dataset may have been discarded or the whole domain may be distributed. Thus, constructing the global model by combining local models is doomed to be an alternative solution. This paper concentrates on finding a method of combination without loss of any information and free of datasets by capturing the graphical characterizations of global models. From the graphical perspective, this paper first captures two graphical characterizations to determine the skeleton and V-structure of global models. Moreover, a simple algorithm is elicited from these graphical characterizations to recover the global underlying model from multiple local models. A preliminary experiment demonstrates empirically that our algorithm is feasible.

[1]  Catriel Beeri,et al.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.

[2]  Cory J. Butz,et al.  Constructing the Dependency Structure of a Multiagent Probabilistic Network , 2001, IEEE Trans. Knowl. Data Eng..

[3]  Qiang Zhao,et al.  Decomposition of structural learning about directed acyclic graphs , 2006, Artif. Intell..

[4]  David A. Bell,et al.  Learning Bayesian networks from data: An information-theory based approach , 2002, Artif. Intell..

[5]  Jing Li,et al.  Knowledge discovery from observational data for process control using causal Bayesian networks , 2007 .

[6]  Serafín Moral,et al.  Qualitative combination of Bayesian networks , 2003, Int. J. Intell. Syst..

[7]  Simon Parsons,et al.  An application of formal argumentation: Fusing Bayesian networks in multi-agent systems , 2007, Artif. Intell..

[8]  Christian Genest,et al.  Combining Probability Distributions: A Critique and an Annotated Bibliography , 1986 .

[9]  Yang Xiang,et al.  A “Microscopic” Study of Minimum Entropy Search in Learning Decomposable Markov Networks , 2004, Machine Learning.

[10]  Ana Cristina Vieira de Melo,et al.  Software maintenance project delays prediction using Bayesian Networks , 2008, Expert Syst. Appl..

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

[12]  Michael Golay,et al.  Data-guided model combination by decomposition and aggregation , 2005, Machine Learning.

[13]  Marek J. Druzdzel,et al.  Combining Knowledge from Different Sources in Causal Probabilistic Models , 2003, J. Mach. Learn. Res..

[14]  Milan Studený,et al.  A recovery algorithm for chain graphs , 1997, Int. J. Approx. Reason..

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

[16]  D. Madigan,et al.  A characterization of Markov equivalence classes for acyclic digraphs , 1997 .

[17]  Bart De Moor,et al.  Predicting the prognosis of breast cancer by integrating clinical and microarray data with Bayesian networks , 2006, ISMB.

[18]  David Maxwell Chickering,et al.  Learning Equivalence Classes of Bayesian Network Structures , 1996, UAI.