• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • 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

    TIIREC: A Tensor Approach for Tag-Driven Item Recommendation with Sparse User Generated Content

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1-s2.0-S002002551730734X-main.pdf
    Size:
    751.8Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Article
    Authors
    Yu, Lu
    Huang, Junming
    Zhou, Ge
    Liu, Chuang
    Zhang, Zi-Ke
    KAUST Department
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2017-05-17
    Online Publication Date
    2017-05-17
    Print Publication Date
    2017-10
    Permanent link to this record
    http://hdl.handle.net/10754/623687
    
    Metadata
    Show full item record
    Abstract
    In recent years, tagging system has become a building block o summarize the content of items for further functions like retrieval or personalized recommendation in various web applications. One nontrivial requirement is to precisely deliver a list of suitable items when users interact with the systems via inputing a specific tag (i.e. a query term). Different from traditional recommender systems, we need deal with a collaborative retrieval (CR) problem, where both characteristics of retrieval and recommendation should be considered to model a ternary relationship involved with query× user× item. Recently, several works are proposed to study CR task from users’ perspective. However, they miss a significant challenge raising from the sparse content of items. In this work, we argue that items will suffer from the sparsity problem more severely than users, since items are usually observed with fewer features to support a feature-based or content-based algorithm. To tackle this problem, we aim to sufficiently explore the sophisticated relationship of each query× user× item triple from items’ perspective. By integrating item-based collaborative information for this joint task, we present an alternative factorized model that could better evaluate the ranks of those items with sparse information for the given query-user pair. In addition, we suggest to employ a recently proposed bayesian personalized ranking (BPR) algorithm to optimize latent collaborative retrieval problem from pairwise learning perspective. The experimental results on two real-world datasets, (i.e. Last.fm, Yelp), verified the efficiency and effectiveness of our proposed approach at top-k ranking metric.
    Citation
    Yu L, Huang J, Zhou G, Liu C, Zhang Z-K (2017) TIIREC: A Tensor Approach for Tag-Driven Item Recommendation with Sparse User Generated Content. Information Sciences. Available: http://dx.doi.org/10.1016/j.ins.2017.05.025.
    Sponsors
    This work was partially supported by Natural Science Foundation of China (Grant Nos. 61673151 and 61503110), Zhejiang Provincial Natural Science Foundation of China (Grant Nos. LY14A050001 and LQ16F030006).
    Publisher
    Elsevier BV
    Journal
    Information Sciences
    DOI
    10.1016/j.ins.2017.05.025
    Additional Links
    http://www.sciencedirect.com/science/article/pii/S002002551730734X
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.ins.2017.05.025
    Scopus Count
    Collections
    Articles; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  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.