Sequential Movie Genre Prediction using Average Transition Probability with Clustering

  title={Sequential Movie Genre Prediction using Average Transition Probability with Clustering},
  author={Jihye Kim and Jinkyung Kim and Jaeyoung Choi},
In recent movie recommendations, predicting the user’s sequential behavior and suggesting the next movie to watch is one of the most important issues. However, capturing such sequential behavior is not easy because each user’s short-term or long-term behavior must be taken into account. For this reason, many research results show that the performance of recommending a specific movie is not very high in a sequential recommendation. In this paper, we propose a cluster-based method for classifying… 



Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation

Fossil is proposed, a similarity-based method that outperforms alternative algorithms, especially on sparse datasets, and qualitatively that it captures personalized dynamics and is able to make meaningful recommendations.

Leveraging Long and Short-Term Information in Content-Aware Movie Recommendation via Adversarial Training

This paper proposes the LSIC model, leveraging long and short-term information for content-aware movie recommendation using adversarial training, and trains a generator as an agent of reinforcement learning which recommends the next movie to a user sequentially.

Recommender system design using movie genre similarity and preferred genres in SmartPhone

A recommender system using movie genre similarity and preferred genres to recommend new genres to targeted customers is proposed and designed and generated to provide related services in a mobile experimental environment.

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.

Factorizing personalized Markov chains for next-basket recommendation

This paper introduces an adaption of the Bayesian Personalized Ranking (BPR) framework for sequential basket data and shows that the FPMC model outperforms both the common matrix factorization and the unpersonalized MC model both learned with and without factorization.

Recurrent Collaborative Filtering for Unifying General and Sequential Recommender

This paper proposes a recommendation model named Recurrent Collaborative Filtering (RCF), which unifies both paradigms within a single model and empirically demonstrates that the model outperforms the state-of-the-art methods across the tasks of both sequential and general recommender.

Self-Attentive Sequential Recommendation

Extensive empirical studies show that the proposed self-attention based sequential model (SASRec) outperforms various state-of-the-art sequential models (including MC/CNN/RNN-based approaches) on both sparse and dense datasets.

Translation-based Recommendation: A Scalable Method for Modeling Sequential Behavior

A unified method is proposed, TransRec, to model such interactions for largescale sequential prediction of users’ personalized sequential behavior, which outperforms the state-of-the-art on a wide spectrum of real-world datasets.

Recurrent Recommender Networks

Recurrent Recommender Networks (RRN) are proposed that are able to predict future behavioral trajectories by endowing both users and movies with a Long Short-Term Memory (LSTM) autoregressive model that captures dynamics, in addition to a more traditional low-rank factorization.