Skip to main content
Log in

MTS Kion Implicit Contextualised Sequential Dataset for Movie Recommendation

  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

We present a new movie and TV show recommendation dataset collected from the real users of MTS Kion video-on-demand platform. In contrast to other popular movie recommendation datasets, such as MovieLens or Netflix, our dataset is based on the implicit interactions registered at the watching time, rather than on explicit ratings. We also provide rich contextual and side information including interactions characteristics (such as temporal information, watch duration and watch percentage), user demographics and rich movies meta-information. In addition, we describe the MTS Kion Challenge—an online recommender systems challenge that was based on this dataset—and provide an overview of the best performing solutions of the winners. We keep the competition sandbox open, so the researchers are welcome to try their own recommendation algorithms and measure the quality on the private part of the dataset.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.

Notes

  1. The dataset available to download on Github: https://github. com/MobileTeleSystems/RecTools/tree/main/datasets/KION.

  2. The only reprocessing we do is anonymisation and adding a small amount of noise in order to preserve the privacy of Kion’s users.

  3. https://ods.ai/competitions/competition-recsys-21.

  4. https://ods.ai/competitions/competition-recsys-21/leaderboard/public_sandbox.

REFERENCES

  1. S. Yogev, A. Gunawardana, and G. Shani, “Evaluating recommendation systems,” in Recommender Systems Handbook (Springer, Boston, MA, 2022), pp. 547–601. https://doi.org/10.1007/978-0-387-85820-3_8

    Book  Google Scholar 

  2. J. Bennett and S. Lanning, “The Netflix Prize,” in Proceedings of KDD Cup and Workshop (2007).

  3. C. J. C. Burges, “From RankNet to LambdaRank to LambdaMART: An overview,” Learning 11 (23-581), 81 (2010).

  4. M. F. Dacrema, P. Cremonesi, and D. Jannach, “Are we really making much progress? A worrying analysis of recent neural recommendation approaches,” in Proceedings of the 13th ACM Conference on Recommender Systems (2019), pp. 101–109.

  5. M. Deshpande and G. Karypis, “Item-based top-N recommendation algorithms,” ACM Trans. Inf. Syst. 22 (1), 143–177 (2004).

    Article  Google Scholar 

  6. A. V. Dorogush, V. Ershov, and A. Gulin, “CatBoost: Gradient boosting with categorical features support” (2018). https://arxiv.org/abs/1810.11363

  7. A. Gulin, I. Kuralenok, and D. Pavlov, “Winning the transfer learning track of Yahoo!’s learning to rank challenge with yetirank,” in Learning to Rank Challenge, Proceedings of Machine Learning Research (2011), pp. 63–76.

  8. F. M. Harper and J. A. Konstan, “The MovieLens datasets: History and context,” ACM Trans. Interactive Intell. Syst. 5 (4), 19 (2015). https://doi.org/10.1145/2827872

    Article  Google Scholar 

  9. B. Hidasi, A. Karatzoglou, L. Baltrunas, and D. Tikk, “Session-based recommendations with recurrent neural networks,” in Proceedings of International Conference on Learning Representations (2016). https://arxiv.org/abs/1511.06939

  10. W.-C. Kang and J. McAuley, “Self-attentive sequential recommendation,” in Proceedings of IEEE International Conference on Data Mining (2018), pp. 197–206.

  11. G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, and T.-Y. Liu, “LightGBM: A highly efficient gradient boosting decision tree,” in Proceedings of Conference on Neural Information Processing Systems (2017), pp. 3146–3154.

  12. M. Kula, “Metadata embeddings for user and item cold-start recommendations” (2015). https://doi.org/10.48550/arXiv.1507.08439

  13. J. Li, Y. Wang, and J. McAuley, “Time interval aware self-attention for sequential recommendation,” in Proceedings of the 13th International Conference on Web Search and Data Mining (2020), pp. 322–330.

  14. A. Petrov and C. Macdonald, “Effective and efficient training for sequential recommendation using recency sampling,” in Proceedings of the 16th ACM Conference on Recommender Systems (2022). https://doi.org/10.48550/arXiv.2207.02643

  15. A. Petrov and C. Macdonald, “A systematic review and replicability study of BERT4Rec for sequential recommendation,” in Reproducibility Track of the 16th ACM Conference on Recommender Systems (2022). https://doi.org/10.48550/arXiv.2207.07483

  16. A. Petrov and Yu. Makarov, “Attention-based neural re-ranking approach for next city in trip recommendations,” in Proceedings of the ACM WSDM Workshop on Web Tourism (2021), pp. 41–45.

  17. S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, “BPR: Bayesian personalized ranking from implicit feedback,” in Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (2009), pp. 452–461.

  18. S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme, “Factorizing personalized Markov chains for next-basket recommendation,” in Proceedings of the 19th International Conference on World Wide Web (2010), pp. 811–820.

  19. S. Rendle, Z. Gantner, C. Freudenthaler, and L. Schmidt-Thieme, “Fast context-aware recommendations with factorization machines,” in Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval (2011), pp. 635–644.

  20. H. Steck, L. Baltrunas, E. Elahi, D. Liang, Y. Raimond, and J. Basilico, “Deep learning for recommender systems: A Netflix case study,” AI Magazine 42 (3), 7–18 (2021).

    Article  Google Scholar 

  21. F. Sun, J. Liu, J. Wu, C. Pei, X. Lin, W. Ou, and P. Jiang, “BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer,” in Proceedings of Conference on Information and Knowledge Management (2019), pp. 1441–1450. https://doi.org/10.48550/arXiv.1904.06690

  22. J. Tang and K. Wang, “Personalized top-N sequential recommendation via convolutional sequence embedding,” in Proceedings of The 11th ACM International Conference on Web Search and Data Mining (2018), pp. 565–573.

  23. W. X. Zhao, S. Mu, Y. Hou, Z. Lin, Y. Chen, X. Pan, K. Li, Y. Lu, H. Wang, C. Tian, et al., “Recbole: Towards a unified, comprehensive and efficient framework for recommendation algorithms,” in Proceedings of Conference on Information and Knowledge Management (2021), pp. 4653–4664.

Download references

ACKNOWLEDGMENTS

We would would like to acknowledge Kion challenge participants Oleg Lashinin, Stepan Zimin, and Olga for providing descriptions of their Kion Challenge solutions, MTS Holding for providing the Kion dataset, ODS.ai international platform for hosting the competition. The contribution of Ildar Safilo and D.I. Ignatov to the article was done within the framework of the HSE University Basic Research Program.

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to I. Safilo, D. Tikhonovich or A. V. Petrov.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Publisher’s Note.

Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Safilo, I., Tikhonovich, D., Petrov, A.V. et al. MTS Kion Implicit Contextualised Sequential Dataset for Movie Recommendation. Dokl. Math. 108 (Suppl 2), S456–S464 (2023). https://doi.org/10.1134/S1064562423701594

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562423701594

Navigation