Handling the Data Growth with Privacy Preservation in Collaborative Filtering

  • Xiwei Wang
  • Jun Zhang
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 229)


The emergence of electric business facilitates people in purchasing merchandises over the Internet. To sell the products better, online service providers use recommender systems to provide recommendations to customers. Most recommender systems are based on collaborative filtering (CF) technique. This technique provides recommendations based on users’ transaction history. Due to the technical limitations, many online merchants ask a third party to help develop and maintain recommender systems instead of doing that themselves. Therefore, they need to share their data with these third parties and users’ private information is prone to leaking. Furthermore, the fast data growth should be handled by the data owner efficiently without sacrificing privacy. In this chapter, we propose a privacy preserving data updating scheme for collaborative filtering purpose and study its performance on two different datasets. The experimental results show that the proposed scheme does not degrade recommendation accuracy and can preserve a satisfactory level of privacy while updating the data efficiently.


Collaborative filtering Data growth Missing value imputation  Non-negative matrix factorization Privacy preservation Singular value decomposition Updating 


  1. 1.
    Agrawal D, Aggarwal, CC (2001) On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS ’01, ACM, pp 247–255Google Scholar
  2. 2.
    Brand Matthew (2006) Fast low-rank modifications of the thin singular value decomposition. Linear Algebra Appl 415(1):20–30MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Breese JS, Heckerman D, Kadie CM (1998) Empirical analysis of predictive algorithms for collaborative filtering. Technical report, Microsoft Research, Microsoft CorporationGoogle Scholar
  4. 4.
    Canny J (2002) Collaborative filtering with privacy. In: Proceedings of the 2002 IEEE symposium on security and privacy, IEEE Computer Society, pp 45–57Google Scholar
  5. 5.
    Ding C, Li T, Peng W, Park H (2006) Orthogonal nonnegative matrix trifactorizations for clustering. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, SIGKDD ’06, ACM, pp 126–135Google Scholar
  6. 6.
    Goldberg K, Roeder T, Gupta D, Perkins C (2001) Eigentaste: a constant time collaborative filtering algorithm. Inf Retr 4(2):133–151MATHCrossRefGoogle Scholar
  7. 7.
    Koch O, Lubich C (2007) Dynamical low-rank approximation. SIAM J Matrix Anal Appl 29(2):434–454MathSciNetCrossRefGoogle Scholar
  8. 8.
    Polat H, Du W (2005) Privacy-preserving collaborative filtering. Int J Electron Commer 9(4):9–35Google Scholar
  9. 9.
    Resnick P, Iacovou N, Suchak M, Bergstrom P, Riedl J (1994) Grouplens: an open architecture for collaborative filtering of netnews. In: Proceedings of ACM 1994 conference on computer supported cooperative work, ACM, pp 175–186Google Scholar
  10. 10.
    Sarwar BM, Karypis G, Konstan JA, Riedl JT (2000) Application of dimensionality reduction in recommender systems—a case study. In: Proceedings of ACM WebKDD workshop, ACMGoogle Scholar
  11. 11.
    Shardanand U, Maes P (1995) Social information filtering: algorithms for automating “word of mouth”. In: Proceedings of the SIGCHI conference on Human factors in computing systems, CHI ’95, ACM Press/Addison-Wesley Publishing Co, pp 210–217Google Scholar
  12. 12.
    Stewart GW (1990) Perturbation theory for the singular value decomposition. Technical report, Computer Science Department, University of MarylandGoogle Scholar
  13. 13.
    Tougas J, Spiteri RJ (2007) Updating the partial singular value decomposition in latent semantic indexing. Comput Stat Data Anal 52:174–183MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Wang J, Zhan J, Zhang J (2008) Towards real-time performance of data value hiding for frequent data updates. In: Proceedings of the IEEE international conference on granular computing, IEEE Computer Society, pp 606–611Google Scholar
  15. 15.
    Wang X, Zhang J (2012) SVD-based privacy preserving data updating in collaborative filtering. In: Lecture notes in engineering and computer science: proceedings of the world congress on engineering 2012, WCE 2012, IAENG, pp 377–284Google Scholar
  16. 16.
    Zhang S, Wang W, Ford J, Makedon F (2006) Learning from incomplete ratings using non-negative matrix factorization. In: Proceedings of the sixth SIAM international conference on data mining, SIAM, pp 548–552Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of KentuckyLexingtonUSA

Personalised recommendations