IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6136095.html
   My bibliography  Save this article

Attention with Long-Term Interval-Based Deep Sequential Learning for Recommendation

Author

Listed:
  • Zhao Li
  • Long Zhang
  • Chenyi Lei
  • Xia Chen
  • Jianliang Gao
  • Jun Gao

Abstract

Modeling user behaviors as sequential learning provides key advantages in predicting future user actions, such as predicting the next product to purchase or the next song to listen to, for the purpose of personalized search and recommendation. Traditional methods for modeling sequential user behaviors usually depend on the premise of Markov processes, while recently recurrent neural networks (RNNs) have been adopted to leverage their power in modeling sequences. In this paper, we propose integrating attention mechanism into RNNs for better modeling sequential user behaviors. Specifically, we design a network featuring A ttention with L ong-term I nterval-based G ated R ecurrent U nits (ALI-GRU) to model temporal sequences of user actions. Compared to previous works, our network can exploit the information of temporal dimension extracted by time interval-based GRU in addition to normal GRU to encoding user actions and has a specially designed matrix-form attention function to characterize both long-term preferences and short-term intents of users, while the attention-weighted features are finally decoded to predict the next user action. We have performed experiments on two well-known public datasets as well as a huge dataset built from real-world data of one of the largest online shopping websites. Experimental results show that the proposed ALI-GRU achieves significant improvement compared to state-of-the-art RNN-based methods. ALI-GRU is also adopted in a real-world application and results of the online A/B test further demonstrate its practical value.

Suggested Citation

  • Zhao Li & Long Zhang & Chenyi Lei & Xia Chen & Jianliang Gao & Jun Gao, 2020. "Attention with Long-Term Interval-Based Deep Sequential Learning for Recommendation," Complexity, Hindawi, vol. 2020, pages 1-13, July.
  • Handle: RePEc:hin:complx:6136095
    DOI: 10.1155/2020/6136095
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/6136095.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/6136095.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/6136095?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:6136095. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.