IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v470y2017icp1-11.html
   My bibliography  Save this article

Link prediction in complex networks based on an information allocation index

Author

Listed:
  • Pei, Panpan
  • Liu, Bo
  • Jiao, Licheng

Abstract

An important issue in link prediction of complex networks is to make full use of different kinds of available information simultaneously. To tackle this issue, recently, an information-theoretic model has been proposed and a novel Neighbor Set Information Index (NSI) has been designed. Motivated by this work, we proposed a more general information-theoretic model by further distinguishing the contributions from different variables of the available features. Then, by introducing the resource allocation process into the model, we designed a new index based on neighbor sets with a virtual information allocation process: Neighbor Set Information Allocation Index(NSIA). Experimental studies on real world networks from disparate fields indicate that NSIA performs well compared with NSI as well as other typical proximity indices.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:470:y:2017:i:c:p:1-11
    DOI: 10.1016/j.physa.2016.11.069
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116308755
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2016.11.069?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. Qian-Ming Zhang & Linyuan Lü & Wen-Qiang Wang & Yu-Xiao & Tao Zhou, 2013. "Potential Theory for Directed Networks," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-8, February.
    2. Göbel, F. & Jagers, A. A., 1974. "Random walks on graphs," Stochastic Processes and their Applications, Elsevier, vol. 2(4), pages 311-336, October.
    3. 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.
    4. 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.
    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. 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.
    7. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    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. 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).
    2. 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.

    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. 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).
    2. 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.
    3. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Xie, Zheng & Zhang, Shengjun & Yi, Dongyun, 2015. "Predicting link directions using local directed path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 260-267.
    4. 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).
    5. 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.
    6. Liu, Yangyang & Zhao, Chengli & Wang, Xiaojie & Huang, Qiangjuan & Zhang, Xue & Yi, Dongyun, 2016. "The degree-related clustering coefficient and its application to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 454(C), pages 24-33.
    7. 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.
    8. 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.
    9. 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.
    10. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    11. 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.
    12. 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).
    13. 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).
    14. 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).
    15. Lee, Yan-Li & Dong, Qiang & Zhou, Tao, 2021. "Link prediction via controlling the leading eigenvector," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    16. Liao, Hao & Zeng, An & Zhang, Yi-Cheng, 2015. "Predicting missing links via correlation between nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 216-223.
    17. 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.
    18. 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.
    19. 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).
    20. 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.

    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:phsmap:v:470:y:2017:i:c:p:1-11. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.