• Login
    View Item 
    •   Home
    • Research
    • Book Chapters
    • View Item
    •   Home
    • Research
    • Book Chapters
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Collaborative User Network Embedding for Social Recommender Systems

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1.9781611974973.43.pdf
    Size:
    909.5Kb
    Format:
    PDF
    Description:
    Main article
    Download
    Type
    Book Chapter
    Authors
    Zhang, Chuxu
    Yu, Lu
    Wang, Yan
    Shah, Chirag
    Zhang, Xiangliang cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Date
    2017-06-09
    Online Publication Date
    2017-06-09
    Print Publication Date
    2017-06-30
    Permanent link to this record
    http://hdl.handle.net/10754/625053
    
    Metadata
    Show full item record
    Abstract
    To address the issue of data sparsity and cold-start in recommender system, social information (e.g., user-user trust links) has been introduced to complement rating data for improving the performances of traditional model-based recommendation techniques such as matrix factorization (MF) and Bayesian personalized ranking (BPR). Although effective, the utilization of the explicit user-user relationships extracted directly from such social information has three main limitations. First, it is difficult to obtain explicit and reliable social links. Only a small portion of users indicate explicitly their trusted friends in recommender systems. Second, the “cold-start” users are “cold” not only on rating but also on socializing. There is no significant amount of explicit social information that can be useful for “cold-start” users. Third, an active user can be socially connected with others who have different taste/preference. Direct usage of explicit social links may mislead recommendation. To address these issues, we propose to extract implicit and reliable social information from user feedbacks and identify top-k semantic friends for each user. We incorporate the top-k semantic friends information into MF and BPR frameworks to solve the problems of ratings prediction and items ranking, respectively. The experimental results on three real-world datasets show that our proposed approaches achieve better results than the state-of-the-art MF with explicit social links (with 3.0% improvement on RMSE), and social BPR (with 9.1% improvement on AUC).
    Citation
    Zhang C, Yu L, Wang Y, Shah C, Zhang X (2017) Collaborative User Network Embedding for Social Recommender Systems. Proceedings of the 2017 SIAM International Conference on Data Mining: 381–389. Available: http://dx.doi.org/10.1137/1.9781611974973.43.
    Sponsors
    Research reported in this publication was partially supported by the US Institute of Museum and Library Services (IMLS) National Leadership Grant #LG-81-16-0025, and the King Abdullah University of Science and Technology (KAUST).
    Publisher
    Society for Industrial & Applied Mathematics (SIAM)
    Journal
    Proceedings of the 2017 SIAM International Conference on Data Mining
    DOI
    10.1137/1.9781611974973.43
    Additional Links
    http://epubs.siam.org/doi/10.1137/1.9781611974973.43
    ae974a485f413a2113503eed53cd6c53
    10.1137/1.9781611974973.43
    Scopus Count
    Collections
    Computer Science Program; Book Chapters; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.