A novel method for combining Bayesian networks, theoretical analysis, and its applications

被引:24
作者
Feng, Guang [1 ]
Zhang, Jia-Dong [2 ]
Liao, Stephen Shaoyi [3 ]
机构
[1] Guangdong Univ Technol, Ctr Network Informat & Modern Educ Technol, Guangzhou 510006, Guangdong, Peoples R China
[2] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[3] City Univ Hong Kong, Dept Informat Syst, Hong Kong, Hong Kong, Peoples R China
关键词
Bayesian networks combination; Conditional independencies; Association degree superpose; Knowledge fusion; ROC CURVE; CLASSIFICATION; COMBINATION; DIAGNOSIS; ACCURACY; AREA;
D O I
10.1016/j.patcog.2013.12.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Effective knowledge integration plays a very important role in knowledge engineering and knowledge-based machine learning. The combination of Bayesian networks (BNs) has shown a promising technique in knowledge fusion and the way of combining BNs remains a challenging research topic. An effective method of BNs combination should not impose any particular constraints on the underlying BNs such that the method is applicable to a variety of knowledge engineering scenarios. In general, a sound method of BNs combination should satisfy three fundamental criteria, that is, avoiding cycles, preserving the conditional independencies of BN structures, and preserving the characteristics of individual BN parameters, respectively. However, none of the existing BNs combination method satisfies all the aforementioned criteria. Accordingly, there are only marginal theoretical contributions and limited practical values of previous research on BNs combination. In this paper, following the approach adopted by existing BNs combination methods, we assume that there is an ancestral ordering shared by individual BNs that helps avoid cycles. We first design and develop a novel BNs combination method that focuses on the following two aspects: (1) a generic method for combining BNs that does not impose any particular constraints on the underlying BNs, and (2) an effective approach ensuring that the last two criteria of BNs combination are satisfied. Further through a formal analysis, we compare the properties of the proposed method and that of three classical BNs combination methods, and hence to demonstrate the distinctive advantages of the proposed BNs combination method. Finally, we apply the proposed method in recommender systems for estimating users' ratings based on their implicit preferences, bank direct marketing for predicting clients' willingness of deposit subscription, and disease diagnosis for assessing patients' breast cancer risk. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2057 / 2069
页数:13
相关论文
共 38 条
[1]   Recommender systems for evaluating computer messages [J].
Avery, C ;
Zeckhauser, R .
COMMUNICATIONS OF THE ACM, 1997, 40 (03) :88-89
[2]   The use of the area under the roc curve in the evaluation of machine learning algorithms [J].
Bradley, AP .
PATTERN RECOGNITION, 1997, 30 (07) :1145-1159
[3]   A noise-detection based AdaBoost algorithm for mislabeled data [J].
Cao, Jingjing ;
Kwong, Sam ;
Wang, Ran .
PATTERN RECOGNITION, 2012, 45 (12) :4451-4465
[4]   Learning equivalence classes of Bayesian-network structures [J].
Chickering, DM .
JOURNAL OF MACHINE LEARNING RESEARCH, 2002, 2 (03) :445-498
[5]  
Claypool M., P 6 INT C INT US INT, P33
[6]   Qualitative combination of Bayesian networks [J].
del Sagrado, J ;
Moral, S .
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2003, 18 (02) :237-249
[7]  
Dietterich T.G., P 1 INT WORKSH MULT, P1
[8]  
Dreiseitl S, 2001, J BIOMED INFORM, V34, P28, DOI 10.1006/jbin.2001.10004
[9]   Evaluating implicit measures to improve web search [J].
Fox, S ;
Karnawat, K ;
Mydland, M ;
Dumais, S ;
White, T .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2005, 23 (02) :147-168
[10]  
Goecks J., P 5 INT C INT US INT, P129