Skip to main content

Privacy-Preserving Eigentaste-Based Collaborative Filtering

  • Conference paper
Advances in Information and Computer Security (IWSEC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4752))

Included in the following conference series:

Abstract

With the evolution of e-commerce, privacy is becoming a major concern. Many e-companies employ collaborative filtering (CF) techniques to increase their sales by providing truthful recommendations to customers. Many algorithms have been employed for CF purposes; and Eigentaste-based algorithm is one of them. Customers’ preferences about products they purchased previously or showed interest are needed to provide recommendations. However, due to privacy concerns, customers refuse to contribute their ratings at all; or they might decide to give false data. Providing truthful referrals based on such inadequate and false data is impossible. Therefore, providing privacy measures is vital for collecting truthful data and producing recommendations.

In this paper, we investigate how to achieve CF tasks (predictions and top-N recommendations) using Eigentaste, which is a constant time CF algorithm, without greatly exposing users’ privacy. To accomplish privacy, we employ randomized perturbation techniques (RPT). We modify and/or simplify original Eigentaste algorithm in such a way to provide private referrals efficiently with decent accuracy. We investigate our proposed schemes in terms of privacy. To evaluate the overall performance of our schemes, we conduct experiments using real data sets. We then analyze our outcomes and finally provide some suggestions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy-preserving data mining algorithms. In: Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Santa Barbara, CA, USA, May 21–23 2001, pp. 247–255 (2001)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD on Management of Data, Dallas, TX, USA, May 15–18 2000, pp. 439–450 (2000)

    Google Scholar 

  3. Brassard, G., Crépeau, C., Robert, J.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234–238. Springer, Heidelberg (1987)

    Google Scholar 

  4. Canny, J.: Collaborative filtering with privacy. In: Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, USA, pp. 45–57 (May 2002)

    Google Scholar 

  5. Canny, J.: Collaborative filtering with privacy via factor analysis. In: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Tampere, Finland, pp. 238–245 (August 2002)

    Google Scholar 

  6. Cranor, L.F.: ‘I didn’t buy it for myself’ privacy and E-commerce personalization. In: Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, Washington, DC, USA, October 30, 2003, pp. 111–117 (2003)

    Google Scholar 

  7. Cranor, L.F., Reagle, J., Ackerman, M.S.: Beyond concern: Understanding net users’ attitudes about online privacy. Technical report, AT&T Labs-Research, (April 1999), available from http://www.research.att.com/library/trs/TRs/99/99.4.3/report.htm

  8. Ding, C., He, X.: K-means clustering via principal component analysis. In: ICML 2004.Proceedings of the 21th International Conference on Machine Learning, Banff, Alberta, Canada, pp. 225–232 (July 2004)

    Google Scholar 

  9. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28, 637–647 (1985)

    Article  MathSciNet  Google Scholar 

  10. Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval 4(2), 133–151 (2001)

    Article  MATH  Google Scholar 

  11. Gupta, D., Digiovanni, M., Narita, H., Goldberg, K.: Jester 2.0: A new linear-time collaborative filtering algorithm applied to jokes. In: Proceedings of the Workshop on Recommender Systems: Algorithms and Evaluation, 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Berkeley, CA, USA (August 1999)

    Google Scholar 

  12. Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: Random data perturbation techniques and privacy-preserving data mining. In: ICDM 2003. Proceedings of the 3rd IEEE International Conference on Data Mining, Melbourne, FL, USA, pp. 19–22 (2003)

    Google Scholar 

  13. Kim, D., Yum, B.: Collaborative filtering based on iterative principal component analysis. Expert Systems with Applications 28(4), 823–830 (2005)

    Article  Google Scholar 

  14. Polat, H.: Privacy-preserving collaborative filtering. International Journal of Electronic Commerce 9(4), 9–36 (2005)

    Google Scholar 

  15. Polat, H., Du., W.: Privacy-preserving collaborative filtering on vertically partitioned data. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 3–7. Springer, Heidelberg (2005)

    Google Scholar 

  16. Polat, H., Du, W.: Privacy-preserving top-N recommendation on horizontally partitioned data. In: WI 2005.Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence,September 19–22, 2005, Paris, France, (2005)

    Google Scholar 

  17. Polat, H., Du, W.: Achieving private recommendations using randomized response techniques. In: Ng, W-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 9–12. Springer, Heidelberg (2006)

    Google Scholar 

  18. Polat, H., Du., W.: Effects of inconsistently masked data using RPT on CF with privacy. In: Proceedings of the 22nd ACM Symposium on Applied Computing, Special Track on E-commerce Technologies, Seoul, Korea (March 2007)

    Google Scholar 

  19. Sarwar, B.M., Karypis, G., Konstan, J.A., Riedl, J.T.: Application of dimensionality reduction in recommender system–A case study. In: Proceedings of the ACM WebKDD 2000 Web Mining for E-commerce Workshop, August 20, 2000, Boston, MA, USA, (2000)

    Google Scholar 

  20. Sarwar, B.M., Konstan, J.A., Borchers, A., Herlocker, J.L., Miller, B.N., Riedl, J.T.: Using filtering agents to improve prediction quality in the GroupLens research collaborative filtering system. In: Proceedings of the 1998 ACM Conference on Computer Supported Cooperative Work, Seattle, WA, USA, November 14–18, 1998, pp. 345–354 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Atsuko Miyaji Hiroaki Kikuchi Kai Rannenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yakut, I., Polat, H. (2007). Privacy-Preserving Eigentaste-Based Collaborative Filtering. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds) Advances in Information and Computer Security. IWSEC 2007. Lecture Notes in Computer Science, vol 4752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75651-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75651-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75650-7

  • Online ISBN: 978-3-540-75651-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics