IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v13y2022i2d10.1007_s13198-021-01371-w.html
   My bibliography  Save this article

An approach for predicting missing links in social network using node attribute and path information

Author

Listed:
  • Ankita Singh

    (University School of Information, Communication and Technology, Guru Gobind Singh Indraprastha University
    Indira Gandhi Delhi Technical University for Women)

  • Nanhay Singh

    (NSUT East Campus (Formerly AIACTR))

Abstract

In social networks, link prediction is the task to identify links in future. Many existing link prediction techniques used similarity scores to predict links. An essential concern in the link prediction problem is identifying missing links between the nodes when there are no common neighbors between the nodes. Considering this, a new algorithm proposed, namely Similarity-based Algorithm using Degree and Common Neighbour (SADCN) which includes a node's degree in the shortest path and common neighbor. For experiment evaluation, three datasets are used to test our method performance against some standard similarity index and the recently proposed algorithms for link prediction, which depicts that our approach achieved comparable AUC values to those that consider common neighbors and it gives better AUC for those links, where no mutual neighbour between the two nodes exists. Finally, we create feature vectors and use XGB classifiers for predicting links. It shows that our proposed algorithm can improve the F-measure and accuracy in a feature based link prediction model.

Suggested Citation

  • Ankita Singh & Nanhay Singh, 2022. "An approach for predicting missing links in social network using node attribute and path information," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(2), pages 944-956, April.
  • Handle: RePEc:spr:ijsaem:v:13:y:2022:i:2:d:10.1007_s13198-021-01371-w
    DOI: 10.1007/s13198-021-01371-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-021-01371-w
    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/s13198-021-01371-w?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. David Liben‐Nowell & Jon Kleinberg, 2007. "The link‐prediction problem for social networks," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 58(7), pages 1019-1031, May.
    2. Aaron Clauset & Cristopher Moore & M. E. J. Newman, 2008. "Hierarchical structure and the prediction of missing links in networks," Nature, Nature, vol. 453(7191), pages 98-101, May.
    3. 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).
    4. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    5. 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.
    6. Wu, Zhihao & Lin, Youfang & Wang, Jing & Gregory, Steve, 2016. "Link prediction with node clustering coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 1-8.
    Full references (including those not matched with items on IDEAS)

    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. Wang, Jun & Zhang, Qian-Ming & Zhou, Tao, 2019. "Tag-aware link prediction algorithm in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 105-111.
    2. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    3. Zhou, Tao & Lee, Yan-Li & Wang, Guannan, 2021. "Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    4. Bütün, Ertan & Kaya, Mehmet, 2019. "A pattern based supervised link prediction in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 1136-1145.
    5. Park, Ji Hwan & Chang, Woojin & Song, Jae Wook, 2020. "Link prediction in the Granger causality network of the global currency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    6. Lee, Yan-Li & Dong, Qiang & Zhou, Tao, 2021. "Link prediction via controlling the leading eigenvector," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    7. Chen, Xing & Wu, Tao & Xian, Xingping & Wang, Chao & Yuan, Ye & Ming, Guannan, 2020. "Enhancing robustness of link prediction for noisy complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).
    8. Kumar, Ajay & Singh, Shashank Sheshar & Singh, Kuldeep & Biswas, Bhaskar, 2020. "Link prediction techniques, applications, and performance: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    9. Chunning Wang & Fengqin Tang & Xuejing Zhao, 2023. "LPGRI: A Global Relevance-Based Link Prediction Approach for Multiplex Networks," Mathematics, MDPI, vol. 11(14), pages 1-15, July.
    10. Wu, Jiehua & Shen, Jing & Zhou, Bei & Zhang, Xiayan & Huang, Bohuai, 2019. "General link prediction with influential node identification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 996-1007.
    11. Yao, Yabing & Zhang, Ruisheng & Yang, Fan & Tang, Jianxin & Yuan, Yongna & Hu, Rongjing, 2018. "Link prediction in complex networks based on the interactions among paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 52-67.
    12. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    13. 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.
    14. 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.
    15. 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.
    16. Shugang Li & Ziming Wang & Beiyan Zhang & Boyi Zhu & Zhifang Wen & Zhaoxu Yu, 2022. "The Research of “Products Rapidly Attracting Users” Based on the Fully Integrated Link Prediction Algorithm," Mathematics, MDPI, vol. 10(14), pages 1-19, July.
    17. Wu, Tao & Chen, Leiting & Zhong, Linfeng & Xian, Xingping, 2017. "Predicting the evolution of complex networks via similarity dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 662-672.
    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. Mungo, Luca & Lafond, François & Astudillo-Estévez, Pablo & Farmer, J. Doyne, 2023. "Reconstructing production networks using machine learning," Journal of Economic Dynamics and Control, Elsevier, vol. 148(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:ijsaem:v:13:y:2022:i:2:d:10.1007_s13198-021-01371-w. 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.