IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v159y2022ics0960077922003307.html
   My bibliography  Save this article

Link prediction for existing links in dynamic networks based on the attraction force

Author

Listed:
  • Chi, Kuo
  • Qu, Hui
  • Yin, Guisheng

Abstract

Link prediction has become an important technology which can be widely applied to many aspects of social network analysis. Numerous link prediction methods have been proposed in recent years, which can detect missing links in the current network and predict whether two disconnected nodes will be connected in the future. However, some existing links may be spurious links that should be removed from the current network, and some existing links will leave the network in the future because network changes over time. In this paper, a novel link prediction approach based on the attraction force between nodes in dynamic networks is proposed to detect spurious links at time t and predict whether existing links at time t will leave the network at time t + 1. At first, the attraction force between nodes is defined according to the law of gravitation, and a level is assigned to each node in the network at time t. Then, the connection probability of each pair of connected nodes is calculated according to the level of nodes and the attraction force between nodes. Next, the connection probability of all existing links is calculated to detect whether they were spurious links that should be removed from the network at time t. For an existing link, the lower the connection probability, the more likely it is to be a spurious link. Furthermore, the changes of network from time t to t + 1 is considered to build a virtual network and the connection probability of all existing links in the virtual network is calculated to predict whether they will leave the network at time t + 1. Experimental results on some real-world networks show that the proposed approach can achieve acceptable prediction accuracy and can be effectively applied to the prediction of existing links in dynamic networks.

Suggested Citation

  • Chi, Kuo & Qu, Hui & Yin, Guisheng, 2022. "Link prediction for existing links in dynamic networks based on the attraction force," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
  • Handle: RePEc:eee:chsofr:v:159:y:2022:i:c:s0960077922003307
    DOI: 10.1016/j.chaos.2022.112120
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077922003307
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2022.112120?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. Wu, Zhihao & Lin, Youfang & Zhao, Yiji & Yan, Hongyan, 2018. "Improving local clustering based top-L link prediction methods via asymmetric link clustering information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 492(C), pages 1859-1874.
    2. Wahid-Ul-Ashraf, Akanda & Budka, Marcin & Musial, Katarzyna, 2019. "How to predict social relationships — Physics-inspired approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1110-1129.
    3. 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.
    4. Fei Tan & Yongxiang Xia & Boyao Zhu, 2014. "Link Prediction in Complex Networks: A Mutual Information Perspective," PLOS ONE, Public Library of Science, vol. 9(9), pages 1-8, September.
    5. Zhang, Peng & Qiu, Dan & Zeng, An & Xiao, Jinghua, 2018. "A comprehensive comparison of network similarities for link prediction and spurious link elimination," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 500(C), pages 97-105.
    6. Ma, Xiaoke & Sun, Penggang & Wang, Yu, 2018. "Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 121-136.
    7. Barabási, A.L & Jeong, H & Néda, Z & Ravasz, E & Schubert, A & Vicsek, T, 2002. "Evolution of the social network of scientific collaborations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 311(3), pages 590-614.
    8. Zhou, Wen & Jia, Yifan, 2017. "Predicting links based on knowledge dissemination in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 561-568.
    9. 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.
    10. 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.
    11. Aghabozorgi, Farshad & Khayyambashi, Mohammad Reza, 2018. "A new similarity measure for link prediction based on local structures in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 12-23.
    12. 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.
    13. Ma, Ling-ling & Ma, Chuang & Zhang, Hai-Feng & Wang, Bing-Hong, 2016. "Identifying influential spreaders in complex networks based on gravity formula," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 205-212.
    14. Liu, Shuxin & Ji, Xinsheng & Liu, Caixia & Bai, Yi, 2017. "Extended resource allocation index for link prediction of complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 174-183.
    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. 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.
    2. 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).
    3. 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).
    4. Assouli, Nora & Benahmed, Khelifa & Gasbaoui, Brahim, 2021. "How to predict crime — informatics-inspired approach from link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 570(C).
    5. Sherkat, Ehsan & Rahgozar, Maseud & Asadpour, Masoud, 2015. "Structural link prediction based on ant colony approach in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 80-94.
    6. Aziz, Furqan & Gul, Haji & Muhammad, Ishtiaq & Uddin, Irfan, 2020. "Link prediction using node information on local paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    7. Haji Gul & Feras Al-Obeidat & Adnan Amin & Fernando Moreira & Kaizhu Huang, 2022. "Hill Climbing-Based Efficient Model for Link Prediction in Undirected Graphs," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
    8. Tofighy, Sajjad & Charkari, Nasrollah Moghadam & Ghaderi, Foad, 2022. "Link prediction in multiplex networks using intralayer probabilistic distance and interlayer co-evolving factors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    9. Lv, Laishui & Bardou, Dalal & Hu, Peng & Liu, Yanqiu & Yu, Gaohang, 2022. "Graph regularized nonnegative matrix factorization for link prediction in directed temporal networks using PageRank centrality," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    10. Pei, Panpan & Liu, Bo & Jiao, Licheng, 2017. "Link prediction in complex networks based on an information allocation index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 470(C), pages 1-11.
    11. 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.
    12. Orzechowski, Kamil P. & Mrowinski, Maciej J. & Fronczak, Agata & Fronczak, Piotr, 2023. "Asymmetry of social interactions and its role in link predictability: The case of coauthorship networks," Journal of Informetrics, Elsevier, vol. 17(2).
    13. Zhang, Xuejun & Pang, Wenbo & Xia, Yongxiang, 2018. "An intermediary probability model for link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 902-912.
    14. 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).
    15. 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.
    16. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    17. Yu, Jiating & Wu, Ling-Yun, 2022. "Multiple Order Local Information model for link prediction in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    18. Charikhi, Mourad, 2024. "Association of the PageRank algorithm with similarity-based methods for link prediction in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 637(C).
    19. 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.
    20. Liu, Shuxin & Ji, Xinsheng & Liu, Caixia & Bai, Yi, 2017. "Extended resource allocation index for link prediction of complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 174-183.

    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:eee:chsofr:v:159:y:2022:i:c:s0960077922003307. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.