By Topic

Similarity Management in Phonebook-Centric Social Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ekler, P. ; Dept. of Autom. & Appl. Inf., Budapest Univ. of Technol. & Econ., Budapest ; Ivanfi, Z. ; Aczel, K.

In the past years many social network implementations have come to existence. There is not one network but many, and the user-base of these networks is different. Connecting the users of the separate networks is currently unsolved and seducing new users to existing systems becomes harder and harder as the users are not willing to join too many systems and build up their contact base from scratch each time. In this paper we propose a solution for the problem of finding existing contacts in a new system. An implementation of the described algorithm is also illustrated. Utilizing the algorithm in existing or new social networks can efficiently reduce the time needed for the users to find their friends in a newly joined network.

Published in:

Internet and Web Applications and Services, 2009. ICIW '09. Fourth International Conference on

Date of Conference:

24-28 May 2009