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 条
[21]  
Vaidya J., 2002, P 8 ACM SIGKDD INT C, P639, DOI DOI 10.1145/775047.775142
[22]  
WEIGHT J, 2005, EL HLTH INF PRIV C O
[23]  
Wright R., 2004, P 10 ACM SIGKDD INT
[24]  
Yao A. C., 1982, 23rd Annual Symposium on Foundations of Computer Science, P160, DOI 10.1109/SFCS.1982.38
[25]  
ZHAN Z, 2006, IEEE INT WORKSH PRIV
[26]  
ZHAN Z, 2005, 19 ANN IFIP WG 11 3