Privacy-preserving boosting

被引：26
作者：
Gambs, Sebastien [1 ]
Kegl, Balazs [1 ]
Aimeur, Esma [1 ]
机构：
[1] Univ Montreal, Dept Comp Sci & Operat Res, Montreal, PQ H3C 3J7, Canada
来源：
DATA MINING AND KNOWLEDGE DISCOVERY | 2007年 / 14卷 / 01期
基金：
加拿大自然科学与工程研究理事会;
关键词：
privacy-preserving data mining; boosting; AdaBoost distributed learning; secure multiparty computation;
D O I：
10.1007/s10618-006-0051-9
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We describe two algorithms, BiBoost ( Bipartite Boosting) and MultBoost ( Multiparty Boosting), that allow two or more participants to construct a boosting classifier without explicitly sharing their data sets. We analyze both the computational and the security aspects of the algorithms. The algorithms inherit the excellent generalization performance of AdaBoost. Experiments indicate that the algorithms are better than AdaBoost executed separately by the participants, and that, independently of the number of participants, they perform close to AdaBoost executed using the entire data set.
引用
收藏
页码：131 / 170
页数：40
相关论文
共 54 条
[1]  
Agrawal D., 2001, Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, P247, DOI DOI 10.1145/375551.375602
[2]  
AIMEUR E, 2004, P INT WORKSH PRIV SE, P51
[3]  
AMIT Y, 2000, 496 U CHIC DEP STAT
[4]  
[Anonymous], 2000, Privacy-preserving data mining, DOI DOI 10.1145/342009.335438
[5]  
Atallah M., 1999, PROC 1999 WORKSHOP K, P45, DOI DOI 10.1109/KDEX.1999.836532
[6]  
Bayardo RJ, 2005, PROC INT CONF DATA, P217
[7]  
Ben-Or Michael, 1988, P 20 ANN ACM S THEOR, P1, DOI DOI 10.1145/62212.62213
[8]   A framework for evaluating privacy preserving data mining algorithms [J].
Bertino, E ;
Fovino, IN ;
Provenza, LP .
DATA MINING AND KNOWLEDGE DISCOVERY, 2005, 11 (02) :121-154
[9]  
Blake C.L., 1998, UCI repository of machine learning databases
[10]  
Chang L. W., 2000, P DAT APPL SEC, P161
123456