• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • 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 LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Fonarev, Alexander
    Mikhalev, Alexander
    Serdyukov, Pavel
    Gusev, Gleb
    Oseledets, Ivan
    KAUST Department
    King Abdullah University of Science and Technology, Thuwal, Kingdom of Saudi Arabia
    Date
    2017-02-07
    Online Publication Date
    2017-02-07
    Print Publication Date
    2016-12
    Permanent link to this record
    http://hdl.handle.net/10754/623827
    
    Metadata
    Show full item record
    Abstract
    Cold start problem in Collaborative Filtering can be solved by asking new users to rate a small seed set of representative items or by asking representative users to rate a new item. The question is how to build a seed set that can give enough preference information for making good recommendations. One of the most successful approaches, called Representative Based Matrix Factorization, is based on Maxvol algorithm. Unfortunately, this approach has one important limitation - a seed set of a particular size requires a rating matrix factorization of fixed rank that should coincide with that size. This is not necessarily optimal in the general case. In the current paper, we introduce a fast algorithm for an analytical generalization of this approach that we call Rectangular Maxvol. It allows the rank of factorization to be lower than the required size of the seed set. Moreover, the paper includes the theoretical analysis of the method's error, the complexity analysis of the existing methods and the comparison to the state-of-the-art approaches.
    Citation
    Fonarev A, Mikhalev A, Serdyukov P, Gusev G, Oseledets I (2016) Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering. 2016 IEEE 16th International Conference on Data Mining (ICDM). Available: http://dx.doi.org/10.1109/ICDM.2016.0025.
    Sponsors
    Work on problem setting and numerical examples was supported by Russian Science Foundation grant 14-11-00659. Work on theoretical estimations of approximation error and practical algorithm was supported by Russian Foundation for Basic Research 16-31-00351 mol_a. Also we thank Evgeny Frolov for helpful discussions.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2016 IEEE 16th International Conference on Data Mining (ICDM)
    DOI
    10.1109/ICDM.2016.0025
    arXiv
    1610.04850
    Additional Links
    http://ieeexplore.ieee.org/document/7837838/
    ae974a485f413a2113503eed53cd6c53
    10.1109/ICDM.2016.0025
    Scopus Count
    Collections
    Conference Papers

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    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.