Experiences with Complex User Profiles for Approximate P2P Community Matching

Author

Dazzi, Patrizio ; Mordacchini, Matteo ; Baglini, Fabio

Author_Institution

ISTI-CNR, Pisa, Italy

fYear

2011

fDate

Aug. 31 2011-Sept. 2 2011

Firstpage

53

Lastpage

58

Abstract

The problem of defining P2P overlays where peers characterized by similar interests are directly connected is currently an important research issue. We have recently proposed a two layer P2P architecture where the first layer exploits a gossip algorithm for the detection of communities of peers characterized by similar interests, while the second layer defines a DHT storing the profiles of the communities detected in the first layer. The DHT is exploited by peers joining the system to find out a community matching its interests. This paper investigates a DHT based approach supporting a similarity based search of user profiles. Our approach exploits Locality Sensitive Hashing to support the similarity indexing. The paper investigates several types of profiles to model user interests and evaluates the indexing mechanisms of the DHT with respect to the different types. Experimental evaluation has been conducted by considering a real data set.

Keywords

file organisation; indexing; information retrieval; peer-to-peer computing; user modelling; DHT; P2P overlays; approximate P2P community matching; community detection; distributed hash table; gossip algorithm; locality sensitive hashing; similarity indexing; two layer P2P architecture; user interest model; user profile; Bandwidth; Communities; Indexing; Measurement; Peer to peer computing; Symmetric matrices; distributed clustering; peer-to-peer; user profiles;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Technology (CIT), 2011 IEEE 11th International Conference on

Conference_Location

Pafos

Print_ISBN

978-1-4577-0383-6

Electronic_ISBN

978-0-7695-4388-8

Type

conf

DOI

10.1109/CIT.2011.96

Filename

6036591