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

How to predict recommendation lists that users do not like

Author

Listed:
  • Gu, Ke
  • Fan, Ying
  • Di, Zengru

Abstract

It is obviously that many user-object online rating systems usually contain the information of the users’ attitudes: like or dislike the objects, these systems can be represented by signed bipartite networks. The common recommendation systems work on unsigned networks. Even if some consider the negative edges, they are all concerned with the objects that the recommended user likes. However, the objects that the user does not like are more personalized. Based on Network-Based Inference (NBI) and signed bipartite networks, we proposed Signed Network-Based Inference (SNBI) to provide the negative recommendation list, which predicts the objects that users dislike. The SNBI algorithm includes two mechanisms: When allocating resources on signed bipartite networks, first method (SNBI-1) does not allocate resources while second method (SNBI-2) reduces resources if there is a negative edge. By comparing the results on the actual data sets with NBI, we found that SNBI-2 which takes into account the role of the negative edges can better predict the objects that user does not like while maintaining the validity of the positive recommendation list, then gives more personalized recommendation.

Suggested Citation

  • Gu, Ke & Fan, Ying & Di, Zengru, 2020. "How to predict recommendation lists that users do not like," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    • Handle: RePEc:eee:phsmap:v:537:y:2020:i:c:s0378437119315304
    DOI: 10.1016/j.physa.2019.122684
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119315304
    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.2019.122684?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. Li, Le & Gu, Ke & Zeng, An & Fan, Ying & Di, Zengru, 2018. "Modeling online social signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 345-352.
    2. Shams, Bita & Haratizadeh, Saman, 2016. "SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 458(C), pages 364-377.
    3. Zhang, Cheng-Jun & Zeng, An, 2012. "Behavior patterns of online users and the effect on information filtering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1822-1830.
    4. Zan Huang & Daniel D. Zeng & Hsinchun Chen, 2007. "Analyzing Consumer-Product Graphs: Empirical Findings and Applications in Recommender Systems," Management Science, INFORMS, vol. 53(7), pages 1146-1164, July.
    5. Zeng, Wei & Zhu, Yu-Xiao & Lü, Linyuan & Zhou, Tao, 2011. "Negative ratings play a positive role in information filtering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4486-4493.
    6. Gu, Ke & Fan, Ying & Zeng, An & Zhou, Jianlin & Di, Zengru, 2018. "Analysis on large-scale rating systems based on the signed network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 507(C), pages 99-109.
    7. Hu, Liang & Ren, Liang & Lin, Wenbin, 2018. "A reconsideration of negative ratings for network-based recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 690-701.
    8. Zhang, Peng & Song, Xiaoyu & Xue, Leyang & Gu, Ke, 2019. "A new recommender algorithm on signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 317-321.
    9. Zan Huang & Wingyan Chung & Hsinchun Chen, 2004. "A graph model for E‐commerce recommender systems," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 55(3), pages 259-274, February.
    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. Khasim Vali Dudekula & Hussain Syed & Mohamed Iqbal Mahaboob Basha & Sudhakar Ilango Swamykan & Purna Prakash Kasaraneni & Yellapragada Venkata Pavan Kumar & Aymen Flah & Ahmad Taher Azar, 2023. "Convolutional Neural Network-Based Personalized Program Recommendation System for Smart Television Users," Sustainability, MDPI, vol. 15(3), pages 1-18, January.
    2. Agrawal, Smita & Patel, Atul, 2021. "SAG Cluster: An unsupervised graph clustering based on collaborative similarity for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(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. Zhang, Yi-Lu & Guo, Qiang & Ni, Jing & Liu, Jian-Guo, 2015. "Memory effect of the online rating for movies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 417(C), pages 261-266.
    2. Hu, Liang & Ren, Liang & Lin, Wenbin, 2018. "A reconsideration of negative ratings for network-based recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 690-701.
    3. Lingling Zhang & Jing Li & Qiuliu Zhang & Fan Meng & Weili Teng, 2019. "Domain Knowledge-Based Link Prediction in Customer-Product Bipartite Graph for Product Recommendation," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(01), pages 311-338, January.
    4. Fan, Rui & Xu, Ke & Zhao, Jichang, 2018. "An agent-based model for emotion contagion and competition in online social media," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 245-259.
    5. Song, Wen-Jun & Guo, Qiang & Liu, Jian-Guo, 2014. "Improved hybrid information filtering based on limited time window," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 192-197.
    6. Jong-Seok Lee & Dan Zhu, 2012. "Shilling Attack Detection---A New Approach for a Trustworthy Recommender System," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 117-131, February.
    7. Ramezani, Mohsen & Moradi, Parham & Akhlaghian, Fardin, 2014. "A pattern mining approach to enhance the accuracy of collaborative filtering in sparse data domains," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 408(C), pages 72-84.
    8. Liu, Chuang & Zhou, Wei-Xing, 2012. "Heterogeneity in initial resource configurations improves a network-based hybrid recommendation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(22), pages 5704-5711.
    9. Deepani B. Guruge & Rajan Kadel & Sharly J. Halder, 2021. "The State of the Art in Methodologies of Course Recommender Systems—A Review of Recent Research," Data, MDPI, vol. 6(2), pages 1-30, February.
    10. Chen, Zhen-Yu & Fan, Zhi-Ping & Sun, Minghe, 2021. "Tensorial graph learning for link prediction in generalized heterogeneous networks," European Journal of Operational Research, Elsevier, vol. 290(1), pages 219-234.
    11. Zan Huang & Daniel Dajun Zeng, 2011. "Why Does Collaborative Filtering Work? Transaction-Based Recommendation Model Validation and Selection by Analyzing Bipartite Random Graphs," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 138-152, February.
    12. Zhang, Peng & Song, Xiaoyu & Xue, Leyang & Gu, Ke, 2019. "A new recommender algorithm on signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 317-321.
    13. Duan, Boping & Liu, Jing & Zhou, Mingxing & Ma, Liangliang, 2016. "A comparative analysis of network robustness against different link attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 448(C), pages 144-153.
    14. 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.
    15. Ni, Jing & Zhang, Yi-Lu & Hu, Zhao-Long & Song, Wen-Jun & Hou, Lei & Guo, Qiang & Liu, Jian-Guo, 2014. "Ceiling effect of online user interests for the movies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 402(C), pages 134-140.
    16. Christian Matt & Thomas Hess, 2016. "Product fit uncertainty and its effects on vendor choice: an experimental study," Electronic Markets, Springer;IIM University of St. Gallen, vol. 26(1), pages 83-93, February.
    17. Yin, Chun-Xia & Peng, Qin-Ke & Chu, Tao, 2012. "Personal artist recommendation via a listening and trust preference network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(5), pages 1991-1999.
    18. Geng, Bingrui & Li, Lingling & Jiao, Licheng & Gong, Maoguo & Cai, Qing & Wu, Yue, 2015. "NNIA-RS: A multi-objective optimization based recommender system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 383-397.
    19. Joonhyuk Yang & Jinwook Kim & Wonjoon Kim & Young Hwan Kim, 2012. "Measuring User Similarity Using Electric Circuit Analysis: Application to Collaborative Filtering," PLOS ONE, Public Library of Science, vol. 7(11), pages 1-10, November.
    20. Gediminas Adomavicius & YoungOk Kwon, 2014. "Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 351-369, May.

    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:537:y:2020:i:c:s0378437119315304. 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.