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

Users’ preference-degree considered diffusion for recommendation on bipartite networks

Author

Listed:
  • Liu, Yuanzhen
  • Han, Lixin
  • Liang, Yi
  • Gou, Zhinan
  • Yang, Yi

Abstract

In recommender systems, ratings represent the degree of users’ preference. However, in the top-L recommendation, negative ratings are simply discarded or different ratings are regarded as the same. In order to evaluate the ability to recommend objects with high ratings, we put forward a metric called Average High-score Ratio (AHR) to compute the average ratio of ratings of recommended objects to the maximum score allowed by the system. The higher of AHR, the more objects with high ratings will be recommended to users. Computing AHR does not need to collect extra information except ratings, and it is a proper metric to measure user satisfaction. We also propose users’ preference-degree considered diffusion algorithm for recommendation, which distinguishes different ratings and is parameter-free. Compared with some classic and recent proposed methods, users’ preference-degree considered diffusion algorithm has the best performance on recommendation accuracy and user satisfaction, and it gets the second-best performance on Hamming distance, novelty, and coverage, only next to the Heat Conduction method. Our work gives exploration on designing recommendation algorithms with better user satisfaction.

Suggested Citation

  • Liu, Yuanzhen & Han, Lixin & Liang, Yi & Gou, Zhinan & Yang, Yi, 2019. "Users’ preference-degree considered diffusion for recommendation on bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 527(C).
  • Handle: RePEc:eee:phsmap:v:527:y:2019:i:c:s0378437119307800
    DOI: 10.1016/j.physa.2019.121323
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119307800
    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.121323?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.

    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:527:y:2019:i:c:s0378437119307800. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.