• 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 LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Multi-Order Attentive Ranking Model for Sequential Recommendation

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    4516-Article Text-7555-1-10-20190706.pdf
    Size:
    628.7Kb
    Format:
    PDF
    Description:
    Publisher's Version/PDF
    Download
    Type
    Conference Paper
    Authors
    Yu, Lu
    Zhang, Chuxu
    Liang, Shangsong
    Zhang, Xiangliang cc
    KAUST Department
    Computer Science Program
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Machine Intelligence & kNowledge Engineering Lab
    KAUST Grant Number
    FCC/1/1976-24-01
    Date
    2019
    Permanent link to this record
    http://hdl.handle.net/10754/670882
    
    Metadata
    Show full item record
    Abstract
    In modern e-commerce, the temporal order behind users’ transactions implies the importance of exploiting the transition dependency among items for better inferring what a user prefers to interact in “near future”. The types of interaction among items are usually divided into individual-level interaction that can stand out the transition order between a pair of items, or union-level relation between a set of items and single one. However, most of existing work only captures one of them from a single view, especially on modeling the individual-level interaction. In this paper, we propose a Multi-order Attentive Ranking Model (MARank) to unify both individual- and union-level item interaction into preference inference model from multiple views. The idea is to represent user’s short-term preference by embedding user himself and a set of present items into multi-order features from intermedia hidden status of a deep neural network. With the help of attention mechanism, we can obtain a unified embedding to keep the individual-level interactions with a linear combination of mapped items’ features. Then, we feed the aggregated embedding to a designed residual neural network to capture union-level interaction. Thorough experiments are conducted to show the features of MARank under various component settings. Furthermore experimental results on several public datasets show that MARank significantly outperforms the state-of-the-art baselines on different evaluation metrics. The source code can be found at https://github.com/voladorlu/MARank.
    Citation
    Yu, L., Zhang, C., Liang, S., & Zhang, X. (2019). Multi-Order Attentive Ranking Model for Sequential Recommendation. Proceedings of the AAAI Conference on Artificial Intelligence, 33, 5709–5716. doi:10.1609/aaai.v33i01.33015709
    Sponsors
    This work was supported by the funding from King Abdullah University of Science and Technology (KAUST), under award number FCC/1/1976-24-01.
    Publisher
    Association for the Advancement of Artificial Intelligence
    Conference/Event name
    The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19)
    DOI
    10.1609/aaai.v33i01.33015709
    Additional Links
    https://ojs.aaai.org//index.php/AAAI/article/view/4516
    Relations
    Is Supplemented By:
    • [Software]
      Title: voladorlu/MARank: Multi-order Attentive Ranking Model for Sequential Recommendation. Publication Date: 2018-11-12. github: voladorlu/MARank Handle: 10754/670908
    ae974a485f413a2113503eed53cd6c53
    10.1609/aaai.v33i01.33015709
    Scopus Count
    Collections
    Conference Papers; 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.