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

Predicting user-item links in recommender systems based on similarity-network resource allocation

Author

Listed:
  • Ai, Jun
  • Cai, Yifang
  • Su, Zhan
  • Zhang, Kuan
  • Peng, Dunlu
  • Chen, Qingkui

Abstract

Recommender systems and link prediction techniques have been widely used in areas such as online information filtering and improving user retrieval efficiency, and their performance and principles are of significant research interest. However, existing mainstream recommendation algorithms still face many challenges, such as the contradiction between prediction accuracy and recommendation diversity, and the limited scalability of algorithms due to the need to use a large number of neighbors for prediction. To address these two issues, this paper designs a user-item link prediction algorithm based on resource allocation within the user similarity network to enhance prediction accuracy while maintaining recommendation diversity and using as few neighbors as possible to achieve better algorithm scalability. We first calculate inter-user similarity based on user history ratings and construct a similarity network among users by filtering the similarity results; subsequently, based on the centrality and community features in this network, we design a similarity measure for resource allocation that incorporates the bipartite graph model and the similarity network; finally, we use this similarity method to select the set of prediction target neighbors, synthesize and use the similarity results, centrality, and community features for the prediction of user-item links. Experimental results on two well-known datasets with three state-of-the-art algorithms show that the proposed approach can improve the prediction accuracy by 2.34% to 15.76% in a shorter time and maintain a high recommendation diversity, and the ranking accuracy of recommendation is also improved. Compared with the benchmark algorithm with the second highest performance ranking, the method designed in this paper can further reduce the number of neighbors required at optimal prediction error by 25% to 56%. The study reveals that resource allocation in similarity networks successfully mines the features embedded in the recommender system, laying the foundation for further understanding the recommender system and improving the performance of related prediction methods.

Suggested Citation

  • Ai, Jun & Cai, Yifang & Su, Zhan & Zhang, Kuan & Peng, Dunlu & Chen, Qingkui, 2022. "Predicting user-item links in recommender systems based on similarity-network resource allocation," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
  • Handle: RePEc:eee:chsofr:v:158:y:2022:i:c:s0960077922002429
    DOI: 10.1016/j.chaos.2022.112032
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.chaos.2022.112032?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. 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.
    2. Jun Ai & Yayun Liu & Zhan Su & Fengyu Zhao & Dunlu Peng, 2021. "K-core decomposition in recommender systems improves accuracy of rating prediction," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 32(07), pages 1-18, July.
    3. Paul Resnick & Neophytos Iacovou & Mitesh Suchak & Peter Bergstrom & John Riedl, 1994. "GroupLens: An Open Architecture for Collaborative Filtering of Netnews," Working Paper Series 165, MIT Center for Coordination Science.
    4. Zhan Su & Jun Ai & Qingling Zhang & Naixue Xiong, 2017. "An improved robust finite-time dissipative control for uncertain fuzzy descriptor systems with disturbance," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(8), pages 1581-1596, June.
    5. Pan, Ying & Li, De-Hua & Liu, Jian-Guo & Liang, Jing-Zhang, 2010. "Detecting community structure in complex networks via node similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(14), pages 2849-2857.
    6. Ai, Jun & Su, Zhan & Li, Yan & Wu, Chunxue, 2019. "Link prediction based on a spatial distribution model with fuzzy link importance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 527(C).
    7. 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.
    8. Su, Zhan & Zheng, Xiliang & Ai, Jun & Shen, Yuming & Zhang, Xuanxiong, 2020. "Link prediction in recommender systems based on vector similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 560(C).
    9. Liu, Jian & Liu, Tingzhan, 2010. "Detecting community structure in complex networks using simulated annealing with k-means algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(11), pages 2300-2309.
    10. 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)

    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. 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.
    2. Gao, Jian & Zhou, Tao, 2017. "Evaluating user reputation in online rating systems via an iterative group-based ranking method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 473(C), pages 546-560.
    3. Zhou, Kuang & Martin, Arnaud & Pan, Quan, 2015. "A similarity-based community detection method with multiple prototype representation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 519-531.
    4. Su, Zhan & Zheng, Xiliang & Ai, Jun & Shen, Yuming & Zhang, Xuanxiong, 2020. "Link prediction in recommender systems based on vector similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 560(C).
    5. Sun, Hong-liang & Ch’ng, Eugene & Yong, Xi & Garibaldi, Jonathan M. & See, Simon & Chen, Duan-bing, 2018. "A fast community detection method in bipartite networks by distance dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 108-120.
    6. 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.
    7. 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).
    8. 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).
    9. 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.
    10. 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).
    11. 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.
    12. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    13. 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.
    14. 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.
    15. Shang, Ronghua & Luo, Shuang & Zhang, Weitong & Stolkin, Rustam & Jiao, Licheng, 2016. "A multiobjective evolutionary algorithm to find community structures based on affinity propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 453(C), pages 203-227.
    16. 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.
    17. 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.
    18. 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).
    19. Chen, Ling-Jiao & Gao, Jian, 2018. "A trust-based recommendation method using network diffusion processes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 679-691.
    20. Wang, Wenjun & Liu, Dong & Liu, Xiao & Pan, Lin, 2013. "Fuzzy overlapping community detection based on local random walk and multidimensional scaling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(24), pages 6578-6586.

    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:158:y:2022:i:c:s0960077922002429. 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.