Privacy-preserving collaborative data mining

被引:17
作者
Zhan, Justin [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
关键词
Classification (of information) - Data mining - Data privacy - Problem solving;
D O I
10.1109/MCI.2008.919071
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data collection is a necessary step in data raining process. Due to privacy reasons, collecting data from different paries becomes difficult. Privacy concerns may prevent the parties from directly sharing the data and some types of information about the data. How multiple parties collaboratively conduct data mining without breaching data privacy presents a challenge. The objective of this paper is to provide solutions for privacy-preserving collaborative data mining problems. In particular, we illustrate how to conduct privacy-preserving naive Bayesian classification which is one of the data mining tasks. To measure the privacy level for privacy-preserving schemes, we propose a definition of privacy and show that our Solutions preserve data privacy.
引用
收藏
页码:31 / 41
页数:11
相关论文
共 26 条
[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]  
[Anonymous], CS97557 U CAL
[3]  
[Anonymous], 2002, Proceedings of The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, DOI DOI 10.1145/775047.775080
[4]  
[Anonymous], 2000, Privacy-preserving data mining, DOI DOI 10.1145/342009.335438
[5]  
CHAUM D, 1985, COMMUN ACM, V28, P1030, DOI 10.1145/4372.4373
[6]  
Cormen T. H., 2001, Introduction to Algorithms, V2nd
[7]  
Di Crescenzo G., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P141, DOI 10.1145/276698.276722
[8]  
Dolev D., 1991, STOC 91, P542
[9]  
DU W, 2002, IEEE WORKSH PRIV SEC
[10]  
DU W, 2003, P 9 ACM SIGKDD INT C