IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v39y2022i2d10.1007_s00357-021-09408-2.html
   My bibliography  Save this article

Supervised Classification for Link Prediction in Facebook Ego Networks With Anonymized Profile Information

Author

Listed:
  • Riccardo Giubilei

    (Sapienza University of Rome
    Luiss Guido Carli)

  • Pierpaolo Brutti

    (Sapienza University of Rome)

Abstract

Social networks are very dynamic objects where nodes and links are continuously added or removed. Hence, an important but challenging task is link prediction, that is, to predict the likelihood of a future association between any two nodes. We use a classification approach to perform link prediction on data retrieved from Facebook in the typical form of ego networks. In addition to the more traditional topological features, we also consider the attributes of the nodes—i.e., users’ publicly available profile information—to fully assess the similarity between nodes. We propose two new attribute-based features, validating their predictive power through an extensive comparison with natural competitors from the literature. Finally, one of the proposed features is selected when building a state-of-the-art procedure for link prediction that achieves an average AUROC of 96.59% over 85 test ego networks. Valuable insights on the interpretation of the results in the specific context of friendship recommendation in Facebook are also provided.

Suggested Citation

  • Riccardo Giubilei & Pierpaolo Brutti, 2022. "Supervised Classification for Link Prediction in Facebook Ego Networks With Anonymized Profile Information," Journal of Classification, Springer;The Classification Society, vol. 39(2), pages 302-325, July.
    • Handle: RePEc:spr:jclass:v:39:y:2022:i:2:d:10.1007_s00357-021-09408-2
    DOI: 10.1007/s00357-021-09408-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-021-09408-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-021-09408-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    2. Tao Zhou & Linyuan Lü & Yi-Cheng Zhang, 2009. "Predicting missing links via local information," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 71(4), pages 623-630, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Van-Vang Le & Toai Kim Tran & Bich-Ngan T. Nguyen & Quoc-Dung Nguyen & Vaclav Snasel, 2022. "Network Alignment across Social Networks Using Multiple Embedding Techniques," Mathematics, MDPI, vol. 10(21), pages 1-18, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    2. Chen, Ling-Jiao & Zhang, Zi-Ke & Liu, Jin-Hu & Gao, Jian & Zhou, Tao, 2017. "A vertex similarity index for better personalized recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 607-615.
    3. Andreas Spitz & Anna Gimmler & Thorsten Stoeck & Katharina Anna Zweig & Emőke-Ágnes Horvát, 2016. "Assessing Low-Intensity Relationships in Complex Networks," PLOS ONE, Public Library of Science, vol. 11(4), pages 1-17, April.
    4. Liu, Chuang & Zhou, Wei-Xing, 2012. "Heterogeneity in initial resource configurations improves a network-based hybrid recommendation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(22), pages 5704-5711.
    5. Shenshen Bai & Longjie Li & Jianjun Cheng & Shijin Xu & Xiaoyun Chen, 2018. "Predicting Missing Links Based on a New Triangle Structure," Complexity, Hindawi, vol. 2018, pages 1-11, December.
    6. Xia, Yongxiang & Pang, Wenbo & Zhang, Xuejun, 2021. "Mining relationships between performance of link prediction algorithms and network structure," Chaos, Solitons & Fractals, Elsevier, vol. 153(P2).
    7. Qiaoran Yang & Zhiliang Dong & Yichi Zhang & Man Li & Ziyi Liang & Chao Ding, 2021. "Who Will Establish New Trade Relations? Looking for Potential Relationship in International Nickel Trade," Sustainability, MDPI, vol. 13(21), pages 1-15, October.
    8. Weihua Lei & Luiz G. A. Alves & Luís A. Nunes Amaral, 2022. "Forecasting the evolution of fast-changing transportation networks using machine learning," Nature Communications, Nature, vol. 13(1), pages 1-12, December.
    9. Rafiee, Samira & Salavati, Chiman & Abdollahpouri, Alireza, 2020. "CNDP: Link prediction based on common neighbors degree penalization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    10. Wang, Zuxi & Wu, Yao & Li, Qingguang & Jin, Fengdong & Xiong, Wei, 2016. "Link prediction based on hyperbolic mapping with community structure for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 609-623.
    11. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    12. Moradabadi, Behnaz & Meybodi, Mohammad Reza, 2016. "Link prediction based on temporal similarity metrics using continuous action set learning automata," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 460(C), pages 361-373.
    13. Yichi Zhang & Zhiliang Dong & Sen Liu & Peixiang Jiang & Cuizhi Zhang & Chao Ding, 2021. "Forecast of International Trade of Lithium Carbonate Products in Importing Countries and Small-Scale Exporting Countries," Sustainability, MDPI, vol. 13(3), pages 1-23, January.
    14. Peng Liu & Liang Gui & Huirong Wang & Muhammad Riaz, 2022. "A Two-Stage Deep-Learning Model for Link Prediction Based on Network Structure and Node Attributes," Sustainability, MDPI, vol. 14(23), pages 1-15, December.
    15. Liu, Jin-Hu & Zhu, Yu-Xiao & Zhou, Tao, 2016. "Improving personalized link prediction by hybrid diffusion," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 199-207.
    16. Feng, Sida & Li, Huajiao & Qi, Yabin & Guan, Qing & Wen, Shaobo, 2017. "Who will build new trade relations? Finding potential relations in international liquefied natural gas trade," Energy, Elsevier, vol. 141(C), pages 1226-1238.
    17. Chengjun Zhang & Jin Liu & Yanzhen Qu & Tianqi Han & Xujun Ge & An Zeng, 2018. "Enhancing the robustness of recommender systems against spammers," PLOS ONE, Public Library of Science, vol. 13(11), pages 1-14, November.
    18. Zhang, Xue & Wang, Xiaojie & Zhao, Chengli & Yi, Dongyun & Xie, Zheng, 2014. "Degree-corrected stochastic block models and reliability in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 553-559.
    19. Kai Yang & Yuan Liu & Zijuan Zhao & Xingxing Zhou & Peijin Ding, 2023. "Graph attention network via node similarity for link prediction," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 96(3), pages 1-10, March.
    20. Zhou, Yinzuo & Wu, Chencheng & Tan, Lulu, 2021. "Biased random walk with restart for link prediction with graph embedding method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 570(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:39:y:2022:i:2:d:10.1007_s00357-021-09408-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.