DocumentCode :
2382843
Title :
FOAF introductions: Automatically growing and improving the accuracy of detected social graphs
Author :
Banford, Jamie ; McDiarmid, Alisdair ; Irvine, James
Author_Institution :
Dept. of Electron. & Electr. Eng., Univ. of Strathclyde, Glasgow, UK
fYear :
2010
fDate :
1-3 Dec. 2010
Firstpage :
75
Lastpage :
81
Abstract :
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.
Keywords :
graph theory; mobile computing; social networking (online); FOAF introductions; detected social graphs; friend of a friend; mobile applications; mobile social network; network growth; triadic closure; FOAF; Mobile Applications; Network Growth; Social Computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pervasive Computing and Applications (ICPCA), 2010 5th International Conference on
Conference_Location :
Maribor
Print_ISBN :
978-1-4244-9144-5
Type :
conf
DOI :
10.1109/ICPCA.2010.5704078
Filename :
5704078
Link To Document :
بازگشت