• Corpus ID: 67855678

A Long-Short Demands-Aware Model for Next-Item Recommendation

  title={A Long-Short Demands-Aware Model for Next-Item Recommendation},
  author={Ting Bai and Pan Du and Wayne Xin Zhao and Ji-Rong Wen and Jian-Yun Nie},
Recommending the right products is the central problem in recommender systems, but the right products should also be recommended at the right time to meet the demands of users, so as to maximize their values. Users' demands, implying strong purchase intents, can be the most useful way to promote products sales if well utilized. Previous recommendation models mainly focused on user's general interests to find the right products. However, the aspect of meeting users' demands at the right time has… 
CTRec: A Long-Short Demands Evolution Model for Continuous-Time Recommendation
This paper proposes a novel self-attentive Continuous-Time Recommendation model (CTRec) for capturing the evolving demands of users over time, and observes in particular that CTRec is capable of learning the purchase cycles of products and estimating the purchase time of a product given a user.
SDM: Sequential Deep Matching Model for Online Large-scale Recommender System
A new sequential deep matching (SDM) model to capture users' dynamic preferences by combining short-term sessions and long-term behaviors, which has been successfully deployed on online large-scale recommender system at Taobao and achieves improvements in terms of a range of commercial metrics.
One4all User Representation for Recommender Systems in E-commerce
This paper systematically compares the generalizability of two learning strategies, i.e., transfer learning through the proposed model, ShopperBERT, vs. learning from scratch, and shows the computational efficiency and embedding visualization of the pre-trained features.
Long- and short-term self-attention network for sequential recommendation
This paper proposes a novel multi-layer long- and short-term self-attention network (LSSA) for sequential recommendation that outperforms state-of-the-art methods with a wide margin.
Advanced Customer Activity Prediction Based on Deep Hierarchic Encoder-Decoders
This work will present a new and innovative architectural approach of applying state-of-the-art hierarchical multi-module encoder-decoder architecture in order to solve several of current state of the art recommender systems issues and produce by-products such as product need-based segmentation and customer behavioral segmentation in an end-to-end trainable approach.
Interest-Behaviour Multiplicative Network for Resource-limited Recommendation
This paper proposes an interest-behaviour multiplicative network to predict the user's future interaction based on dynamic connections between users and items, and introduces mutual information to measure the similarity between the user action and fused features to predict future interaction.


Learning Hierarchical Representation Model for NextBasket Recommendation
This paper introduces a novel recommendation approach, namely hierarchical representation model (HRM), which can well capture both sequential behavior and users' general taste by involving transaction and user representations in prediction.
Scalable Demand-Aware Recommendation
This work proposes a highly scalable alternating minimization approach with which it can solve problems with millions of users and millions of items in a single thread and shows superior prediction accuracies on multiple real-world data sets.
Translation-based Recommendation
This paper proposes a unified method, TransRec, to model such third-order relationships for large-scale sequential prediction, and embeds items into a 'transition space' where users are modeled as translation vectors operating on item sequences.
Basket-Sensitive Personalized Item Recommendation
This paper addresses the problem scenario where the user is currently holding a basket of items, and the task is to recommend an item to be added to the basket, and proposes a factorizationbased model called BFM and another model called CBFM that further incorporates basket-level constraints.
Sequence-Aware Recommender Systems
A categorization of the corresponding recommendation tasks and goals is proposed, existing algorithmic solutions are summarized, methodological approaches when benchmarking what the authors call sequence-aware recommender systems are discussed, and open challenges in the area are outlined.
Item-based collaborative filtering recommendation algorithms
This paper analyzes item-based collaborative ltering techniques and suggests that item- based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.
Effective Next-Items Recommendation via Personalized Sequential Pattern Mining
Experimental results demonstrate that the proposed framework effectively improves the efficiency for mining sequential patterns, increases the user-relevance of the identified frequent patterns, and most importantly, generates significantly more accurate next-items recommendation for the target users.
Buy It Again: Modeling Repeat Purchase Recommendations
This paper presents the approach it developed for modeling repeat purchase recommendations and has demonstrated over 7% increase in the product click through rate on the personalized recommendations page of the Amazon.com website and has resulted in the launch of several customer-facing features on the Amazon website, the Amazon mobile app, and other Amazon websites.
Factorization meets the neighborhood: a multifaceted collaborative filtering model
The factor and neighborhood models can now be smoothly merged, thereby building a more accurate combined model and a new evaluation metric is suggested, which highlights the differences among methods, based on their performance at a top-K recommendation task.
Session-based Recommendations with Recurrent Neural Networks
It is argued that by modeling the whole session, more accurate recommendations can be provided by an RNN-based approach for session-based recommendations, and introduced several modifications to classic RNNs such as a ranking loss function that make it more viable for this specific problem.