By Topic

FOAF introductions: Automatically growing and improving the accuracy of detected social graphs

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
$33 $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)
Jamie Banford ; Centre for Intelligent and Dynamic Communications, Dept. of Electronic and Electrical Engineering, University of Strathclyde, Glasgow, UK, G1 1XW ; Alisdair McDiarmid ; James Irvine

Friend of a Friend (FOAF) introductions are an effective means to grow detected social graphs in mobile applications. By detecting triadic closure in the social graph they both introduce co-present users who are not already acquainted, and improve the accuracy of the social graph. We searched for the presence of triadic closure in a real mobile social network, and tested the suitability of FOAF introductions as a means for efficient network growth. We found that triadic closure does occur in mobile networks, and that half of the triads found were suitable for FOAF introductions.

Published in:

Pervasive Computing and Applications (ICPCA), 2010 5th International Conference on

Date of Conference:

1-3 Dec. 2010