• Corpus ID: 221293005

Many-to-one Recurrent Neural Network for Session-based Recommendation

  title={Many-to-one Recurrent Neural Network for Session-based Recommendation},
  author={Amine Dadoun and Raphael Troncy},
This paper presents the D2KLab team's approach to the RecSys Challenge 2019 which focuses on the task of recommending accommodations based on user sessions. What is the feeling of a person who says "Rooms of the hotel are enormous, staff are friendly and efficient"? It is positive. Similarly to the sequence of words in a sentence where one can affirm what the feeling is, analysing a sequence of actions performed by a user in a website can lead to predict what will be the item the user will add… 

Figures and Tables from this paper


A Comparison of Frequent Pattern Techniques and a Deep Learning Method for Session-Based Recommendation
A state-of-the-art RNN-based approach is compared with a number of (heuristics-based) frequent paŠern mining methods both with respect to the accuracy of their recommendations and withrespect to their computational complexity.
Evaluation of session-based recommendation algorithms
An in-depth performance comparison of a number of session-based recommendation algorithms based on recurrent neural networks, factorized Markov model approaches, as well as simpler methods based, e.g., on nearest neighbor schemes reveals that algorithms of this latter class often perform equally well or significantly better than today’s more complex approaches based on deep neural networks.
Location Embeddings for Next Trip Recommendation
This work proposes an approach that leverages contextual, collaborative and content information in order to recommend personalized destinations to travelers and compares this approach with a set of state of the art collaborative filtering methods and deep learning based recommender systems.
Generating Text with Recurrent Neural Networks
The power of RNNs trained with the new Hessian-Free optimizer by applying them to character-level language modeling tasks is demonstrated, and a new RNN variant that uses multiplicative connections which allow the current input character to determine the transition matrix from one hidden state vector to the next is introduced.
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
These advanced recurrent units that implement a gating mechanism, such as a long short-term memory (LSTM) unit and a recently proposed gated recurrent unit (GRU), are found to be comparable to LSTM.
Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks
The Tree-LSTM is introduced, a generalization of LSTMs to tree-structured network topologies that outperform all existing systems and strong LSTM baselines on two tasks: predicting the semantic relatedness of two sentences and sentiment classification.
Adam: A Method for Stochastic Optimization
This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
Amazon.com Recommendations: Item-to-Item Collaborative Filtering
This work compares three common approaches to solving the recommendation problem: traditional collaborative filtering, cluster models, and search-based methods, and their algorithm, which is called item-to-item collaborative filtering.
Matrix Factorization Techniques for Recommender Systems
As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest neighbor techniques for producing product recommendations, allowing the incorporation of
Mining association rules between sets of items in large databases
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.