Research on the Personalized Privacy Preserving Distributed Data Mining

被引:3
作者
Shen, Yanguang [1 ]
Shao, Hui [1 ]
Li, Yan [1 ]
机构
[1] Hebei Univ Engn, Sch Informat Sci & Elect Engn, Handan, Peoples R China
来源
2009 SECOND INTERNATIONAL CONFERENCE ON FUTURE INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING, FITME 2009 | 2009年
关键词
personalized privacy preserving; distributed data mining; decision tree classification; SMC; K-anonymity;
D O I
10.1109/FITME.2009.115
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we studied privacy preserving distributed data mining.The existing methods focus on a universal approach that exerts preservation in the same degree for all persons, without catering for their concrete needs. In view of this we innovatively proposed a new framework combining the Secure Multiparty Computation(SMC) with K-anonymity technology, and achieved personalized privacy preserving distributed data mining based on decision tree classification algorithm. Compared with other algorithms our methord could make a good trade-off point between privacy and accuracy, with high efficiency and low-overhead of computing and communication.
引用
收藏
页码:436 / 439
页数:4
相关论文
共 7 条
[1]  
Agrawal R., 2000, Privacy-preserving data mining, P439, DOI DOI 10.1145/342009.335438
[2]  
*BEN PINK HP LABS, 2002, SIGKDD EXPLORATIONS, V4, P12
[3]  
DU W, 2002, P IEEE ICDM WORKSH P
[4]  
[方炜炜 FANG Wei-wei], 2009, [计算机科学, Computer Science], V36, P239
[5]  
Iyengar V.S., 2002, P 8 ACM SIGKDD INT C, P279, DOI DOI 10.1145/775047.775089
[6]   Bottom-up generalization: A data mining solution to privacy protection [J].
Wang, K ;
Yu, PS ;
Chakraborty, S .
FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2004, :249-256
[7]  
Xiao X., 2006, P ACM SIGMOD INT C M, P229