Abstract
This paper proposes P2Prec, a P2P recommendation overlay that facilitates document sharing for on-line communities. Given a query, the goal of P2PRec is to find relevant peers that can recommend documents that are relevant for the query and are of high quality. A document is relevant to a query if it covers the same topics. It is of high quality if relevant peers have rated it highly. P2PRec finds relevant peers through a variety of mechanisms including advanced content-based and collaborative filtering. The topics each peer is interested in are automatically calculated by analyzing the documents the peer holds. Peers become relevant for a topic if they hold a certain number of highly rated documents on this topic. To efficiently disseminate information about peers’ topics and relevant peers, we propose new semantic-based gossip protocols. In addition, we propose an efficient query routing algorithm that selects the best peers to recommend documents based on the gossip-view entries and query topics. At the query’s initiator, recommendations are selectively chosen based on similarity, rates and popularity or other recommendation criteria. In our experimental evaluation, using the TREC09 dataset, we show that using semantic gossip increases recall by a factor of 1.6 compared to well-known random gossiping. Furthermore, P2Prec has the ability to get reasonable recall with acceptable query processing load and network traffic.
Work partially funded by the DataRing project of the French ANR.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: a survey of the state-of-theart and possible extensions. IEEE TKDE 17(6), 734–749 (2005)
Bai, X., Bertier, M., Guerraoui, R., Kermarrec, A.M., Leroy, L.: Gossiping personalized queries. In: EDBT, pp. 87–98 (2010)
Bawa, M., Manku, G.S., Raghavan, P.: SETS: Search enhanced by topic segmentation. In: ACM SIGIR, pp. 306–313 (2003)
Billsus, D., Pazzani, M.J.: Learning collaborative information filters. In: ICML, pp. 46–54 (1998)
Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet Allocation. JMLR 3, 993–1022 (2003)
Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web Caching and Zipf-like Distributions: Evidence and Implications. In: INFOCOM, pp. 126–134 (1999)
Callan, J.: Distributed Information Retrieval. In: Croft, W.B. (ed.) Advances in Information Retrieval, pp. 127–150. Kluwer Academic Publishers, Dordrecht (2000)
Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P systems. Technical report, Stanford University (2003)
Dice, L.R.: Measures of the Amount of Ecologic Association between Species. Ecology 26(3), 297–302 (1945)
Draidi, F., Pacitti, E., Valduriez, P., Kemme, B.: P2Prec: a Recommendation Service for P2P Content Sharing Systems. In: BDA (2010)
Fast, A., Jensen, D., Levine, B.N.: Creating social networks to improve peer to peer networking. In: ACM SIGKDD, pp. 568–573 (2005)
Gavidia, D., Voulgaris, S., Steen, M.: Cyclon: Inexpensive Membership Management for Unstructured P2P Overlays. JNSM 13(2), 197–217 (2005)
Goldberg, D., Nichols, D., Oki, B., Terry, D.: Using Collaborative Filtering to Weave an Information Tapestry. Commun. ACM 35(12), 61–70 (1992)
Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Demers, A., Greene, D., Terry, D.: Epidemic Algorithms for Replicated Database Maintenance. In: ACM PODC, pp. 1–12 (1987)
Hersh, W.R., Buckley, C., Leone, T., Hickam, D.H.: Ohsumed: An interactive retrieval evaluation and new large test collection for research. In: ACM SIGIR, pp. 192–201 (1994)
Jelasity, M., Montresor, A.: Epidemic-style Proactive Aggregation in Large Overlay Networks. In: ICDCS, pp. 102–109 (2004)
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., VanSteen, M.: Gossip-based peer sampling. ACM TOCS 25(3) (2007)
Kendall, J., Kendall, K.: Information delivery systems: an exploration of web pull and push technologies. Commun. AIS 1(4), 1–43 (1999)
Kermarrec, A.M., Eugster, P.T., Guerraoui, R., Massoulieacute, L.: Epidemic Information Dissemination in Distributed Systems. IEEE Computer 37(5), 60–67 (2004)
Kermarrec, A.M., Leroy, V., Moin, A., Thraves, C.: Application of Random Walks to Decentralized Recommender Systems. In: OPODIS, pp. 48–63 (2010)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: ASPLOS, pp. 190–201 (2000)
Miller, B.N., Konstan, J.A., Riedl, J.: PocketLens, Toward a Personal Recommender System. ACM TOIS 22(3), 437–476 (2004)
Peersim p2p simulator, http://www.peersim.sourceforge.net
Phan, X.-H., http://gibbslda.sourceforge.net
Pisson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: search methods. Technical report, Univeristy of New South Wales (2004)
Pouwelse, J., Slobbe, M., Wang, J., Reinders, M.J.T., Sip, H., P2Pbased, P.V.R.: Recommendation using Friends, Taste Buddies and Superpeers. In: IUI (2005)
Qiao, Y., Bustamante, F.E.: Structured and unstructured overlays under the microscope: a measurement-based view of two P2P systems that people use. In: USENIXATEC, pp. 341–355 (2006)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM, pp. 161–172 (2001)
Robertson, S., Hull, D.A.: The TREC-9 filtering track final report. TREC-9, 25-40 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Sahin, O.D., Emekci, F., Agrawal, D.P., El Abbadi, A.: Content-based similarity search over peer-to-peer systems. In: Ng, W.S., Ooi, B.-C., Ouksel, A.M., Sartori, C. (eds.) DBISP2P 2004. LNCS, vol. 3367, pp. 61–78. Springer, Heidelberg (2005)
Salton, G.: A Theory of Indexing. In: Conf. Series in Appl. Math., Soc. For Indust. And Appl. Math., J. W. Arrowsmith Ltd. (1975)
Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of Recommendation Algorithms for e-commerce. In: ACM COEC, pp. 158–167 (2000)
Sripanidkulchai, K., Maggs, B.M., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. INFOCOM 3, 2166–2176 (2003)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, B.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, pp. 149-160 (2001)
Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-Peer Information Retrieval Using Self- Organizing Semantic Overlay Networks. In: ACM SIGCOMM, pp. 175–186 (2003)
Tveit, A.: Peer-to-Peer Based Recommendations for Mobile Commerce. In: WMC, pp. 26–29 (2001)
Upadrashta, Y., Vassileva, J., Grassmann, W.: Social Networks in Peer-to-Peer Systems. In: HICSS (2005)
Voulgaris, S., Van Steen, M.: Epidemic-style management of semantic overlays for content based searching. Technical Report, Amsterdam (2004)
Wang, J., Pouwelse, J.A., Fokker, J.E., de Vries, A.P., Reinders, M.J.T.: Personalization of peer-to-peer television system. Or EuroITV, 147–155, 2006
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report, U. C. Berkeley (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Draidi, F., Pacitti, E., Kemme, B. (2011). P2Prec: A P2P Recommendation System for Large-Scale Data Sharing. In: Hameurlain, A., Küng, J., Wagner, R. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems III. Lecture Notes in Computer Science, vol 6790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23074-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-23074-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23073-8
Online ISBN: 978-3-642-23074-5
eBook Packages: Computer ScienceComputer Science (R0)