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

Information filtering via weighted heat conduction algorithm

Author

Listed:
  • Liu, Jian-Guo
  • Guo, Qiang
  • Zhang, Yi-Cheng

Abstract

In this paper, by taking into account effects of the user and object correlations on a heat conduction (HC) algorithm, a weighted heat conduction (WHC) algorithm is presented. We argue that the edge weight of the user–object bipartite network should be embedded into the HC algorithm to measure the object similarity. The numerical results indicate that both the accuracy and diversity could be improved greatly compared with the standard HC algorithm and the optimal values reached simultaneously. On the Movielens and Netflix datasets, the algorithmic accuracy, measured by the average ranking score, can be improved by 39.7% and 56.1% in the optimal case, respectively, and the diversity could reach 0.9587 and 0.9317 when the recommendation list equals to 5. Further statistical analysis indicates that, in the optimal case, the distributions of the edge weight are changed to the Poisson form, which may be the reason why HC algorithm performance could be improved. This work highlights the effect of edge weight on a personalized recommendation study, which maybe an important factor affecting personalized recommendation performance.

Suggested Citation

  • Liu, Jian-Guo & Guo, Qiang & Zhang, Yi-Cheng, 2011. "Information filtering via weighted heat conduction algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(12), pages 2414-2420.
    • Handle: RePEc:eee:phsmap:v:390:y:2011:i:12:p:2414-2420
    DOI: 10.1016/j.physa.2011.02.023
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jiang, Liang-Chao & Liu, Run-Ran & Jia, Chun-Xiao, 2022. "User-location distribution serves as a useful feature in item-based collaborative filtering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 586(C).
    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. 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.
    4. Zhu, Xuzhen & Tian, Hui & Zhang, Tianqiao, 2018. "Symmetrical information filtering via punishing superfluous diffusion," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 1-9.
    5. Wang, Yang & Han, Lixin, 2020. "Personalized recommendation via network-based inference with time," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 550(C).
    6. 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.
    7. 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.
    8. 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.

    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:390:y:2011:i:12:p:2414-2420. 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.