Skip to main content

Using Friendship Ties and Family Circles for Link Prediction

  • Conference paper
Advances in Social Network Mining and Analysis (SNAKDD 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5498))

Included in the following conference series:

Abstract

Social networks can capture a variety of relationships among the participants. Both friendship and family ties are commonly studied, but most existing work studies them in isolation. Here, we investigate how these networks can be overlaid, and propose a feature taxonomy for link prediction. We show that when there are tightly-knit family circles in a social network, we can improve the accuracy of link prediction models. This is done by making use of the family circle features based on the likely structural equivalence of family members. We investigated the predictive power of overlaying friendship and family ties on three real-world social networks. Our experiments demonstrate significantly higher prediction accuracy (between 15% and 30% more accurate) compared to using more traditional features such as descriptive node attributes and structural features. The experiments also show that a combination of all three types of attributes results in the best precision-recall trade-off.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Huang, Z., Zeng, D.: A Link Prediction Approach to Anomalous Email Detection. In: IEEE International Conference on Systems, Man, and Cybernetics (2006)

    Google Scholar 

  2. Klimt, B., Yang, Y.: The enron corpus: A new dataset for email classification research. In: Boulicaut, J.F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 217–226. Springer, Heidelberg (2004)

    Google Scholar 

  3. Barabasi, A.L., Jeong, H., Neda, Z., Ravasz, E., Schubert, A., Vicsek, T.: Evolution of the social network of scientific collaborations. PHYSICA A 311, 3 (2002)

    Article  MathSciNet  Google Scholar 

  4. Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link Prediction using Supervised Learning. In: Proceedings of the Workshop on Link Analysis, Counter-terrorism and Security (with SIAM Data Mining Conference) (2006)

    Google Scholar 

  5. Liben-Nowell, D., Kleinberg, J.: The Link Prediction Problem for Social Networks. In: Proceedings of the 12th International Conference on Information and Knowledge Management (CIKM) (2003)

    Google Scholar 

  6. Newman, M.: Who is the best connected scientist? a study of scientific coauthorship networks. Working Papers 00-12-064, Santa Fe Institute (December 2000), http://ideas.repec.org/p/wop/safiwp/00-12-064.html

  7. Newman, M.: Coauthorship networks and patterns of scientific collaboration. Proceedings of the National Academy of Sciences 101, 5200–5205 (2004)

    Article  Google Scholar 

  8. Popescul, A., Ungar, L.H.: Statistical relational learning for link prediction. In: Proceedings of the Workshop on Learning Statistical Models from Relational Data at IJCAI 2003 (2003)

    Google Scholar 

  9. Rattigan, M.J., Jensen, D.: The case for anomalous link discovery. SIGKDD Explor. Newsl. 7(2), 41–47 (2005)

    Article  Google Scholar 

  10. Goldenberg, A., Kubica, J., Komarek, P., Moore, A., Schneider, J.: A Comparison of Statistical and Machine Learning Algorithms on the Task of Link Completion. In: KDD Workshop on Link Analysis for Detecting Complex Behavior (2003)

    Google Scholar 

  11. Golbeck, J.: The dynamics of web-based social networks: Membership, relationships, and change. First Monday 12 (2007)

    Google Scholar 

  12. Adamic, L., Adar, E.: Friends and neighbors on the web. Social Networks 25(3), 211–230 (2003)

    Article  Google Scholar 

  13. Kubica, J.M., Moore, A., Cohn, D., Schneider, J.: cGraph: A Fast Graph-Based Method for Link Analysis and Queries. In: Proceedings of the 2003 IJCAI Text-Mining & Link-Analysis Workshop (2003)

    Google Scholar 

  14. Taskar, B., Wong, M.F., Abbeel, P., Koller, D.: Link Prediction in Relational Data. In: Advances in Neural Information Processing Systems, NIPS 2003 (2003)

    Google Scholar 

  15. Kubica, J., Moore, A., Schneider, J., Yang, Y.: Stochastic Link and Group Detection. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence, AAAI 2002 (2002)

    Google Scholar 

  16. Friedland, J., Jensen, D.: Finding Tribes: Identifying Close-Knit Individuals from Employment Patterns. In: Proceedings of Knowledge Discovery and Data Mining (KDD 2007) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheleva, E., Getoor, L., Golbeck, J., Kuter, U. (2010). Using Friendship Ties and Family Circles for Link Prediction. In: Giles, L., Smith, M., Yen, J., Zhang, H. (eds) Advances in Social Network Mining and Analysis. SNAKDD 2008. Lecture Notes in Computer Science, vol 5498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14929-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14929-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14928-3

  • Online ISBN: 978-3-642-14929-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics