Sequence-aware next-item recommendation has recently been studied because of the noteworthy usefulness of the sequential information integrated into recommendation algorithms. Following the development thread of sequential recommendation methods, especially the factored Markov chains segment, and based on a well-designed fusing similarity model with factored high-order Markov chains (i.e., Fossil), we propose a novel and generic similarity learning framework for next-item recommendation called sequence-aware factored mixed similarity model (S-FMSM), which contains two variants with pairwise preference learning and pointwise preference learning. Unlike the baseline methods that model the general representation and the sequential representation in two divided factorization components, we use a factored mixed similarity model that unites the general similarity and the sequential relationship between two successive items for their sequential representation learning. Experiments on six datasets show that our newly introduced general similarity can notably improve the results of the recommended ranking lists. Furthermore, a study on tuning the prior trade-off parameter indicates the importance of the general similarity on different datasets. We adjust the number of latent dimensions and try different similarity measurements, which showcases that our S-FMSM is universal and gives us more insight on it.
[1]
Lars Schmidt-Thieme,et al.
BPR: Bayesian Personalized Ranking from Implicit Feedback
,
2009,
UAI.
[2]
George Karypis,et al.
FISM: factored item similarity models for top-N recommender systems
,
2013,
KDD.
[3]
Dietmar Jannach,et al.
Sequence-Aware Recommender Systems
,
2018,
UMAP.
[4]
Zhong Ming,et al.
Collaborative Recommendation with Multiclass Preference Context
,
2017,
IEEE Intelligent Systems.
[5]
George Karypis,et al.
Item-based top-N recommendation algorithms
,
2004,
TOIS.
[6]
Julian J. McAuley,et al.
Translation-based Recommendation
,
2017,
RecSys.
[7]
Miao Liu,et al.
Mixed similarity learning for recommendation with implicit feedback
,
2017,
Knowl. Based Syst..
[8]
Julian J. McAuley,et al.
Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation
,
2016,
2016 IEEE 16th International Conference on Data Mining (ICDM).
[9]
Lars Schmidt-Thieme,et al.
Factorizing personalized Markov chains for next-basket recommendation
,
2010,
WWW '10.