Abstract

With the emergence of numerous social media sites, individuals, with their limited time, often face a dilemma of choosing a few sites over others. Users prefer more engaging sites, where they can find familiar faces such as friends, relatives, or colleagues. Link prediction methods help find friends using link or content information. Unfortunately, whenever users join any site, they have no friends or any content generated. In this case, sites have no chance other than recommending random influential users to individuals hoping that users by befriending them create sufficient information for link prediction techniques to recommend meaningful friends. In this study, by considering social forces that form friendships, namely, influence, homophily, and confounding, and by employing minimum information available for users, we demonstrate how one can significantly improve random predictions without link or content information. In addition, contrary to the common belief that similarity between individuals is the essence of forming friendships, we show that it is the similarity that one exhibits to the friends of another individual that plays a more decisive role in predicting their future friendship.

Original languageEnglish (US)
Title of host publicationSIAM International Conference on Data Mining 2014, SDM 2014
PublisherSociety for Industrial and Applied Mathematics Publications
Pages947-955
Number of pages9
Volume2
ISBN (Print)9781510811515
DOIs
StatePublished - 2014
Event14th SIAM International Conference on Data Mining, SDM 2014 - Philadelphia, United States
Duration: Apr 24 2014Apr 26 2014

Other

Other14th SIAM International Conference on Data Mining, SDM 2014
CountryUnited States
CityPhiladelphia
Period4/24/144/26/14

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Cite this

Zafarani, R., & Liu, H. (2014). Finding friends on a new site using minimum information. In SIAM International Conference on Data Mining 2014, SDM 2014 (Vol. 2, pp. 947-955). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611973440.108

Finding friends on a new site using minimum information. / Zafarani, Reza; Liu, Huan.

SIAM International Conference on Data Mining 2014, SDM 2014. Vol. 2 Society for Industrial and Applied Mathematics Publications, 2014. p. 947-955.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zafarani, R & Liu, H 2014, Finding friends on a new site using minimum information. in SIAM International Conference on Data Mining 2014, SDM 2014. vol. 2, Society for Industrial and Applied Mathematics Publications, pp. 947-955, 14th SIAM International Conference on Data Mining, SDM 2014, Philadelphia, United States, 4/24/14. https://doi.org/10.1137/1.9781611973440.108
Zafarani R, Liu H. Finding friends on a new site using minimum information. In SIAM International Conference on Data Mining 2014, SDM 2014. Vol. 2. Society for Industrial and Applied Mathematics Publications. 2014. p. 947-955 https://doi.org/10.1137/1.9781611973440.108
Zafarani, Reza ; Liu, Huan. / Finding friends on a new site using minimum information. SIAM International Conference on Data Mining 2014, SDM 2014. Vol. 2 Society for Industrial and Applied Mathematics Publications, 2014. pp. 947-955
@inproceedings{639593e595a54686a10deffc8a41af4c,
title = "Finding friends on a new site using minimum information",
abstract = "With the emergence of numerous social media sites, individuals, with their limited time, often face a dilemma of choosing a few sites over others. Users prefer more engaging sites, where they can find familiar faces such as friends, relatives, or colleagues. Link prediction methods help find friends using link or content information. Unfortunately, whenever users join any site, they have no friends or any content generated. In this case, sites have no chance other than recommending random influential users to individuals hoping that users by befriending them create sufficient information for link prediction techniques to recommend meaningful friends. In this study, by considering social forces that form friendships, namely, influence, homophily, and confounding, and by employing minimum information available for users, we demonstrate how one can significantly improve random predictions without link or content information. In addition, contrary to the common belief that similarity between individuals is the essence of forming friendships, we show that it is the similarity that one exhibits to the friends of another individual that plays a more decisive role in predicting their future friendship.",
author = "Reza Zafarani and Huan Liu",
year = "2014",
doi = "10.1137/1.9781611973440.108",
language = "English (US)",
isbn = "9781510811515",
volume = "2",
pages = "947--955",
booktitle = "SIAM International Conference on Data Mining 2014, SDM 2014",
publisher = "Society for Industrial and Applied Mathematics Publications",

}

TY - GEN

T1 - Finding friends on a new site using minimum information

AU - Zafarani, Reza

AU - Liu, Huan

PY - 2014

Y1 - 2014

N2 - With the emergence of numerous social media sites, individuals, with their limited time, often face a dilemma of choosing a few sites over others. Users prefer more engaging sites, where they can find familiar faces such as friends, relatives, or colleagues. Link prediction methods help find friends using link or content information. Unfortunately, whenever users join any site, they have no friends or any content generated. In this case, sites have no chance other than recommending random influential users to individuals hoping that users by befriending them create sufficient information for link prediction techniques to recommend meaningful friends. In this study, by considering social forces that form friendships, namely, influence, homophily, and confounding, and by employing minimum information available for users, we demonstrate how one can significantly improve random predictions without link or content information. In addition, contrary to the common belief that similarity between individuals is the essence of forming friendships, we show that it is the similarity that one exhibits to the friends of another individual that plays a more decisive role in predicting their future friendship.

AB - With the emergence of numerous social media sites, individuals, with their limited time, often face a dilemma of choosing a few sites over others. Users prefer more engaging sites, where they can find familiar faces such as friends, relatives, or colleagues. Link prediction methods help find friends using link or content information. Unfortunately, whenever users join any site, they have no friends or any content generated. In this case, sites have no chance other than recommending random influential users to individuals hoping that users by befriending them create sufficient information for link prediction techniques to recommend meaningful friends. In this study, by considering social forces that form friendships, namely, influence, homophily, and confounding, and by employing minimum information available for users, we demonstrate how one can significantly improve random predictions without link or content information. In addition, contrary to the common belief that similarity between individuals is the essence of forming friendships, we show that it is the similarity that one exhibits to the friends of another individual that plays a more decisive role in predicting their future friendship.

UR - http://www.scopus.com/inward/record.url?scp=84959912023&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959912023&partnerID=8YFLogxK

U2 - 10.1137/1.9781611973440.108

DO - 10.1137/1.9781611973440.108

M3 - Conference contribution

SN - 9781510811515

VL - 2

SP - 947

EP - 955

BT - SIAM International Conference on Data Mining 2014, SDM 2014

PB - Society for Industrial and Applied Mathematics Publications

ER -