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

Coarse cluster enhancing collaborative recommendation for social network systems

Author

Listed:
  • Zhao, Yao-Dong
  • Cai, Shi-Min
  • Tang, Ming
  • Shang, Min-Sheng

Abstract

Traditional collaborative filtering based recommender systems for social network systems bring very high demands on time complexity due to computing similarities of all pairs of users via resource usages and annotation actions, which thus strongly suppresses recommending speed. In this paper, to overcome this drawback, we propose a novel approach, namely coarse cluster that partitions similar users and associated items at a high speed to enhance user-based collaborative filtering, and then develop a fast collaborative user model for the social tagging systems. The experimental results based on Delicious dataset show that the proposed model is able to dramatically reduce the processing time cost greater than 90% and relatively improve the accuracy in comparison with the ordinary user-based collaborative filtering, and is robust for the initial parameter. Most importantly, the proposed model can be conveniently extended by introducing more users’ information (e.g., profiles) and practically applied for the large-scale social network systems to enhance the recommending speed without accuracy loss.

Suggested Citation

  • Zhao, Yao-Dong & Cai, Shi-Min & Tang, Ming & Shang, Min-Sheng, 2017. "Coarse cluster enhancing collaborative recommendation for social network systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 483(C), pages 209-218.
  • Handle: RePEc:eee:phsmap:v:483:y:2017:i:c:p:209-218
    DOI: 10.1016/j.physa.2017.04.131
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117304247
    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.2017.04.131?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. Dong, Qiang & Yuan, Quan & Shi, Yang-Bo, 2019. "Alleviating the recommendation bias via rank aggregation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 534(C).

    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:483:y:2017:i:c:p:209-218. 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.