Incremental learning of privacy-preserving Bayesian networks

被引:12
作者
Samet, Saeed [1 ]
Miri, Ali [2 ]
Granger, Eric [3 ]
机构
[1] Mem Univ Newfoundland, Fac Med, St John, NF, Canada
[2] Ryerson Univ, Dept Comp Sci, Toronto, ON, Canada
[3] Univ Quebec, Ecole Technol Super, Lab Imagerie Vis & Intelligence Artificielle, Montreal, PQ H3C 3P8, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Security and privacy preserving; Bayesian networks; Incremental learning; Data mining and machine learning; COMPUTATION;
D O I
10.1016/j.asoc.2013.03.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Bayesian Networks (BNs) have received significant attention in various academic and industrial applications, such as modeling knowledge in image processing, engineering, medicine and bio-informatics. Preserving the privacy of sensitive data, owned by different parties, is often a critical issue. However, in many practical applications, BNs must train from data that gradually becomes available at different period of times, on which the traditional batch learning algorithms are not suitable or applicable. In this paper, an algorithm based on a new and efficient version of Sufficient Statistics is proposed for incremental learning with BNs. The standard kappa 2 algorithm is also modified to be utilized inside the incremental learning algorithm. Next, some secure building blocks such as secure comparison, and factorial, which are resistant against colluding attacks and could be applied securely over public channels like internet, are presented to be used inside the main protocol. Then a privacy-preserving protocol is proposed for incremental learning of BNs, in which the structure and probabilities are estimated incrementally from homogeneously distributed and gradually available data among two or multi-parties. Finally, security and complexity analysis along with the experimental results are presented to compare with the batch algorithm and to show its performance and applicability in real world applications. (C) 2013 Elsevier B. V. All rights reserved.
引用
收藏
页码:3657 / 3667
页数:11
相关论文
共 38 条
[21]  
Lam W., 1994, J COMPUTATIONAL INTE, V10, P269
[22]  
LAM W, 1994, P 10 C UNC ART INT, P383
[23]  
Lauritzen S.L., 1996, Oxford Statistical Science Series, V17
[24]  
LAURITZEN SL, 1988, J ROY STAT SOC B MET, V50, P157
[25]   Privacy-sensitive Bayesian network parameter learning [J].
Meng, D ;
Sivakumar, K ;
Kargupta, H .
FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2004, :487-490
[26]  
Pacekajus A., 2006, REFINING BAYESIAN NE
[27]  
Paillier P, 1999, LECT NOTES COMPUT SC, V1592, P223
[28]  
Pearl J., 1988, PROBABILISTIC REASON, DOI DOI 10.1016/C2009-0-27609-4
[29]  
Pearl J., 1985, P 7 C COGN SCI SOC U
[30]  
Regnier-Coudert O., 2011, P 13 ANN C COMP GEN, P815