A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter
We investigate the differences between how some of the fundamental principles of network formation apply among offline friends and how they apply among online friends on Twitter. We consider three fundamental principles of network formation proposed by Schaefer et al.: reciprocity, popularity, and t...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3134 https://ink.library.smu.edu.sg/context/sis_research/article/4134/viewcontent/ComparisonNetworkFormation_Twitter_2016_afv.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-4134 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-41342024-05-31T05:35:49Z A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter NATALI, Felicia ZHU, Feida We investigate the differences between how some of the fundamental principles of network formation apply among offline friends and how they apply among online friends on Twitter. We consider three fundamental principles of network formation proposed by Schaefer et al.: reciprocity, popularity, and triadic closure. Overall, we discover that these principles mainly apply to offline friends on Twitter. Based on how these principles apply to offline versus online friends, we formulate rules to predict offline friendship on Twitter. We compare our algorithm with popular machine learning algorithms and Xiewei’s random walk algorithm. Our algorithm beats the machine learning algorithms on average by 15 % in terms of f-score. Although our algorithm loses 6 % to Xiewei’s random walk algorithm in terms of f-score, it still performs well (f-score above 70 %), and it reduces prediction time complexity from O(n2)to O(n). 2016-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3134 info:doi/10.1007/978-3-319-28361-6_14 https://ink.library.smu.edu.sg/context/sis_research/article/4134/viewcontent/ComparisonNetworkFormation_Twitter_2016_afv.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Network formation Offline friends Online friends Twitter Social network Offline friends prediction Machine learning Offline online Databases and Information Systems Social Media |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Network formation Offline friends Online friends Twitter Social network Offline friends prediction Machine learning Offline online Databases and Information Systems Social Media |
spellingShingle |
Network formation Offline friends Online friends Twitter Social network Offline friends prediction Machine learning Offline online Databases and Information Systems Social Media NATALI, Felicia ZHU, Feida A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter |
description |
We investigate the differences between how some of the fundamental principles of network formation apply among offline friends and how they apply among online friends on Twitter. We consider three fundamental principles of network formation proposed by Schaefer et al.: reciprocity, popularity, and triadic closure. Overall, we discover that these principles mainly apply to offline friends on Twitter. Based on how these principles apply to offline versus online friends, we formulate rules to predict offline friendship on Twitter. We compare our algorithm with popular machine learning algorithms and Xiewei’s random walk algorithm. Our algorithm beats the machine learning algorithms on average by 15 % in terms of f-score. Although our algorithm loses 6 % to Xiewei’s random walk algorithm in terms of f-score, it still performs well (f-score above 70 %), and it reduces prediction time complexity from O(n2)to O(n). |
format |
text |
author |
NATALI, Felicia ZHU, Feida |
author_facet |
NATALI, Felicia ZHU, Feida |
author_sort |
NATALI, Felicia |
title |
A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter |
title_short |
A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter |
title_full |
A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter |
title_fullStr |
A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter |
title_full_unstemmed |
A Comparison of Fundamental Network Formation Principles Between Offline and Online Friends on Twitter |
title_sort |
comparison of fundamental network formation principles between offline and online friends on twitter |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2016 |
url |
https://ink.library.smu.edu.sg/sis_research/3134 https://ink.library.smu.edu.sg/context/sis_research/article/4134/viewcontent/ComparisonNetworkFormation_Twitter_2016_afv.pdf |
_version_ |
1814047554922348544 |