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

Improving personalized link prediction by hybrid diffusion

Author

Listed:
  • Liu, Jin-Hu
  • Zhu, Yu-Xiao
  • Zhou, Tao

Abstract

Inspired by traditional link prediction and to solve the problem of recommending friends in social networks, we introduce the personalized link prediction in this paper, in which each individual will get equal number of diversiform predictions. While the performances of many classical algorithms are not satisfactory under this framework, thus new algorithms are in urgent need. Motivated by previous researches in other fields, we generalize heat conduction process to the framework of personalized link prediction and find that this method outperforms many classical similarity-based algorithms, especially in the performance of diversity. In addition, we demonstrate that adding one ground node that is supposed to connect all the nodes in the system will greatly benefit the performance of heat conduction. Finally, better hybrid algorithms composed of local random walk and heat conduction have been proposed. Numerical results show that the hybrid algorithms can outperform other algorithms simultaneously in all four adopted metrics: AUC, precision, recall and hamming distance. In a word, this work may shed some light on the in-depth understanding of the effect of physical processes in personalized link prediction.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:447:y:2016:i:c:p:199-207
    DOI: 10.1016/j.physa.2015.12.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711501064X
    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.2015.12.036?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. Jin-Hu Liu & Tao Zhou & Zi-Ke Zhang & Zimo Yang & Chuang Liu & Wei-Min Li, 2014. "Promoting Cold-Start Items in Recommender Systems," PLOS ONE, Public Library of Science, vol. 9(12), pages 1-13, December.
    2. Liu, Run-Ran & Liu, Jian-Guo & Jia, Chun-Xiao & Wang, Bing-Hong, 2010. "Personal recommendation via unequal resource allocation on bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(16), pages 3282-3289.
    3. 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.
    4. Zhu, Yu-Xiao & Lü, Linyuan & Zhang, Qian-Ming & Zhou, Tao, 2012. "Uncovering missing links with cold ends," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(22), pages 5769-5778.
    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.
    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).

    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. Yu, Fei & Zeng, An & Gillard, Sébastien & Medo, Matúš, 2016. "Network-based recommendation algorithms: A review," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 192-208.
    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. 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.
    4. 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.
    5. 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.
    6. 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).
    7. 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.
    8. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    9. 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.
    10. 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.
    11. 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.
    12. 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).
    13. Yin, Likang & Deng, Yong, 2018. "Measuring transferring similarity via local information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 498(C), pages 102-115.
    14. Adilson Vital & Diego R. Amancio, 2022. "A comparative analysis of local similarity metrics and machine learning approaches: application to link prediction in author citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 127(10), pages 6011-6028, October.
    15. Karimi, Fariba & Ramenzoni, Verónica C. & Holme, Petter, 2014. "Structural differences between open and direct communication in an online community," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 414(C), pages 263-273.
    16. 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).
    17. An, Ya-Hui & Dong, Qiang & Sun, Chong-Jing & Nie, Da-Cheng & Fu, Yan, 2016. "Diffusion-like recommendation with enhanced similarity of objects," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 708-715.
    18. Xiaoji Wan & Fen Chen & Hailin Li & Weibin Lin, 2022. "Potentially Related Commodity Discovery Based on Link Prediction," Mathematics, MDPI, vol. 10(19), pages 1-27, October.
    19. Víctor Martínez & Fernando Berzal & Juan-Carlos Cubero, 2019. "NOESIS: A Framework for Complex Network Data Analysis," Complexity, Hindawi, vol. 2019, pages 1-14, October.
    20. Xu, Paiheng & Zhang, Rong & Deng, Yong, 2018. "A novel visibility graph transformation of time series into weighted networks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 201-208.

    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:447:y:2016:i:c:p:199-207. 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.