Advertisement

An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network

  • Bo Xie
  • Peng Han
  • Fan Yang
  • Ruimin Shen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3180)

Abstract

Distributed Collaborative Filtering (DCF) has gained more and more attention as an alternative implementation scheme of CF based recommender system, because of its advantage in scalability and privacy protection. However, as the re is no central user database in DCF systems, the task of neighbor searching becomes much more difficult. In this paper, we first propose an efficient distributed user profile management scheme based on distributed hash table (DHT) method, which is one of the most popular and effective routing algorithm in Peer-to-Peer (P2P) overlay network. Then, we present a heuristic neighbor searching algorithm to locate potential neighbors of the active users in order to reduce the network traffic and executive cost. The experimental data show that our DCF algorithm with the neighbor searching scheme has much better scalability than traditional centralized ones with comparable prediction efficiency and accuracy.

Keywords

Active User Overlay Network Collaborative Filter Distribute Hash Table User Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Goldberg, D., Nichols, D., Oki, B.M., Terry, D.: Using collaborative filtering to weave an information tapestry. Communications of the ACM 35(12), 61–70 (1992)CrossRefGoogle Scholar
  2. 2.
    Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, pp. 230–237 (1999)Google Scholar
  3. 3.
    Breese, J., Heckerman, D., Kadie, C.: Empirical Analysis of Predictive Algorithms for Collaborative Filtering. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 43–52 (1998)Google Scholar
  4. 4.
    Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., Riedl, J.: GroupLens: an open architecture for collaborative filtering of netnews. In: Proceedings of the 1994 ACM conference on Computer supported cooperative work, October 22- 26, pp. 175–186. Chapel Hill, North Carolina (1994)CrossRefGoogle Scholar
  5. 5.
    Shardanand, U., Maes, P.: Social information filtering: algorithms for automating “word of mouth”. In: Proceedings of the SIGCHI conference on Human factors in computing systems, Denver, Colorado, United States, May 07-11, pp. 210–217 (1995)Google Scholar
  6. 6.
    Linden, G., Smith, B., York, J.: Amazon.com Recommendations Item-to-item collaborative filtering. IEEE Internet Computing 7(1), 7680 (2003)CrossRefGoogle Scholar
  7. 7.
    Eachmovie collaborative filtering data set.: http://research.compaq.com/SRC/eachmovie
  8. 8.
    Tveit, A.: Peer-to-peer based Recommendations for Mobile Commerce. In: Proceedings of the First International Mobile Commerce Workshop, July 2001, pp. 26–29. ACM Press, Rome (2001)CrossRefGoogle Scholar
  9. 9.
    Olsson, T.: Bootstrapping and Decentralizing Recommender Systems. Licentiate Thesis 2003-006, Department of Information Technology, Uppsala University and SICS (2003)Google Scholar
  10. 10.
    Canny, J.: Collaborative filtering with privacy. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 2002. IEEE Computer Society, Technical Committee on Security and Privacy, pp. 45–57. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  11. 11.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: SIGCOMM (August 2001)Google Scholar
  12. 12.
    Stocal, I., et al.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: ACM SIGCOMM, San Diego, CA, USA, pp. 149–160 (2001)Google Scholar
  13. 13.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems. In: IFIP/ACM Middleware, Hedelberg, Germany (2001)Google Scholar
  14. 14.
    Zhao, B.Y., et al.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech.Rep.UCB/CSB-0-114,UC Berkeley, EECS (2001)Google Scholar
  15. 15.
    Ripeanu, M.: Peer-to-peer Architecture Case Study: Gnutella Network. Technical Report, University of Chicago (2001)Google Scholar
  16. 16.
    Peng, H., Bo, X., Fan, Y., Ruimin, S.: A Scalable P2P Recommender System Based on Distributed Collaborative Filtering. Expert systems with applications 27(2) Elsevier (September 2004) (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Bo Xie
    • 1
  • Peng Han
    • 1
  • Fan Yang
    • 1
  • Ruimin Shen
    • 1
  1. 1.Department of Computer Science and EngineeringShanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations