Privacy Preserving Collaborative Filtering with k-Anonymity through Microaggregation

被引:15
作者
Casino, Fran [1 ]
Domingo-Ferrer, Josep [1 ]
Patsakis, Constantinos [2 ]
Puig, Domenec [1 ]
Solanas, Agusti [1 ]
机构
[1] Univ Rovira & Virgili, Dept Comp Engn & Math, UNESCO Chair Data Privacy, Av Paisos Catalans 26, E-43007 Tarragona, Spain
[2] Trinity Coll Dublin, Sch Comp Engn & Stat, Distributed Syst Grp, Dublin, Ireland
来源
2013 IEEE 10TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE) | 2013年
关键词
Privacy Preserving Collaborative Filtering; Microaggregation; Electronic Commerce; Recommender Systems; Statistical Disclosure Control; RECOMMENDATIONS;
D O I
10.1109/ICEBE.2013.77
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Collaborative Filtering (CF) is a recommender system which is becoming increasingly relevant for the industry. Current research focuses on Privacy Preserving Collaborative Filtering (PPCF), whose aim is to solve the privacy issues raised by the systematic collection of private information. In this paper, we propose a new microaggregation-based PPCF method that distorts data to provide k-anonymity, whilst simultaneously making accurate recommendations. Experimental results demonstrate that the proposed method perturbs data more efficiently than the well-known and widely used distortion method based on Gaussian noise addition.
引用
收藏
页码:490 / 497
页数:8
相关论文
共 43 条
[1]  
Adida B, 2007, LECT NOTES COMPUT SC, V4392, P555
[2]  
[Anonymous], 1996, ADV KNOWLEDGE DISCOV
[3]  
[Anonymous], 2000, WEBKDD 2000 WORKSH
[4]  
Berkvosky S, 2007, RECSYS 07: PROCEEDINGS OF THE 2007 ACM CONFERENCE ON RECOMMENDER SYSTEMS, P9
[5]  
Breese J. S., 1998, Uncertainty in Artificial Intelligence. Proceedings of the Fourteenth Conference (1998), P43
[6]   Comparison of Collaborative Filtering Algorithms: Limitations of Current Techniques and Proposals for Scalable, High-Performance Recommender Systems [J].
Cacheda, Fidel ;
Carneiro, Victor ;
Fernandez, Diego ;
Formoso, Vreixo .
ACM TRANSACTIONS ON THE WEB, 2011, 5 (01)
[7]  
CANNY J, 2002, SEC PRIV 2002 P 2002, P45
[8]  
Cranor L., 2000, TECH REP
[9]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[10]   Ordinal, continuous and heterogeneous k-anonymity through microaggregation [J].
Domingo-Ferrer, J ;
Torra, V .
DATA MINING AND KNOWLEDGE DISCOVERY, 2005, 11 (02) :195-212