?
Similarity Measures and Models for Movie Series Recommender System
P. 181–193.
Bliznuk D., Yagunova E., Pronoza E.
In this paper we propose a method of movie series recommender system development. Our recommender system is content-based, and movie series are represented by their scripts. We experiment with several semantic similarity measures, lexico-morphological metrics, keywords and vector space models to extract similar movie series. Evaluation is conducted in the experiment with informants. The best results are achieved by distributional semantic approach (i.e., using word2vec technology).
Yusupov V., Sukhorukov N., Frolov E., User Modelling and User-Adapted Interaction 2026 Vol. 36 Article 2
Graph-based recommender systems have emerged as a powerful paradigm for personalized recommendations. However, their reliance on full model retraining to incorporate new users or new interactions creates scalability barriers. The task becomes infeasible in real-life recommender systems due to excessive time and resource costs involved. To address this limitation, we propose a fast and efficient ...
Added: March 15, 2026
Yusupov V., Sukhorukov N., Frolov E., User Modeling and User-Adapted Interaction 2025 P. 1–24
Graph-based recommender systems have emerged as a powerful paradigm for personalized recommendations. However, their reliance on full model retraining to incorporate new users or new interactions creates scalability barriers. The task becomes infeasible in real-life recommender systems due to excessive time and resource costs involved. To address this limitation, we propose a fast and efficient ...
Added: March 14, 2026
Yusupov V., Sukhorukov N., Frolov E., , in: User Modeling and User-Adapted Interaction.: Springer, 2026. Ch. 36.2 P. 1–24.
Graph-based recommender systems have emerged as a powerful paradigm for personalized recommendations. However, their reliance on full model retraining to incorporate new users or new interactions creates scalability barriers. The task becomes infeasible in real-life recommender systems due to excessive time and resource costs involved. To address this limitation, we propose a fast and efficient ...
Added: January 29, 2026
Klenitskiy A., Anna Volodkevich, Pembek A. et al., ACM Transactions on Recommender Systems 2026
Sequential recommender systems are an important and in-demand area of research. These systems aim to use the order of interactions in a user’s history to predict future interactions. The premise is that the order of interactions and sequential patterns play an essential role. Therefore, it is crucial to use datasets that exhibit a sequential structure ...
Added: January 28, 2026
Anna Volodkevich, Danil Gusak, Klenitskiy A. et al., User Modelling and User-Adapted Interaction 2025 No. 35 Article 13
The goal of modern sequential recommender systems is often formulated in terms of next-item prediction. In this paper, we explore the applicability of transformer-based generative models for the Top-K sequential recommendation task, where the goal is to predict items that a user is likely to interact with in the “near future.” This goal aligns with ...
Added: January 26, 2026
Klenitskiy A., Fatkulin A., Denisova D. et al., , in: RecSysChallenge '25: Proceedings of the Recommender Systems Challenge 2025.: Association for Computing Machinery (ACM), 2025. P. 26–30.
Building universal user representations that capture the essential aspects of user behavior is a crucial task for modern machine learning systems. In real-world applications, a user’s historical interactions often serve as the foundation for solving a wide range of predictive tasks, such as churn prediction, recommendations, or lifetime value estimation. Using a task-independent user representation ...
Added: January 26, 2026
Ivanova V., Frolov E., Vasilev A., , in: RecSys '25: Proceedings of the Nineteenth ACM Conference on Recommender Systems.: ACM, 2025. P. 1142–1147.
We consider the task of learning from both positive and negative feedback in a sequential recommendation scenario, as both types of feedback are often present in user interactions. Meanwhile, conventional sequential learning models usually focus on considering and predicting positive interactions, ignoring that reducing items with negative feedback in recommendations improves user satisfaction with the ...
Added: January 26, 2026
Pembek A., Fatkulin A., Klenitskiy A. et al., , in: RecSys '25: Proceedings of the Nineteenth ACM Conference on Recommender Systems.: ACM, 2025. P. 626–631.
Many sequential recommender systems suffer from the cold start problem, where items with few or no interactions cannot be effectively used by the model due to the absence of a trained embedding. Content-based approaches, which leverage item metadata, are commonly used in such scenarios. One possible way is to use embeddings derived from content features ...
Added: January 26, 2026
Association for Computing Machinery (ACM), 2026.
KDD is the premier Data Science and AI conference, hosting both a Research and an Applied Data Science Track. The conference will take place from August 9 to 13, 2026, in Jeju, Korea. ...
Added: November 25, 2025
Makeev S., Andreev A., Baikalov V. et al., , in: RecSysChallenge '25: Proceedings of the Recommender Systems Challenge 2025.: Association for Computing Machinery (ACM), 2025. P. 21–25.
This paper describes the 4th-place solution by team ambitious for the RecSys Challenge 2025, organized by Synerise and ACM RecSys, which focused on universal behavioral modeling. The challenge objective was to generate user embeddings effective across six diverse downstream tasks. Our solution integrates (1) a sequential encoder to capture the temporal evolution of user interests, (2) a ...
Added: November 19, 2025
Association for Computing Machinery (ACM), 2025.
Added: November 19, 2025
Khrylchenko K., Baikalov V., Makeev S. et al., , in: RecSys '25: Proceedings of the Nineteenth ACM Conference on Recommender Systems.: ACM, 2025. P. 545–550.
Two-tower neural networks are a popular architecture for the retrieval stage in recommender systems. These models are typically trained with a softmax loss over the item catalog. However, in web-scale settings, the item catalog is often prohibitively large, making full softmax infeasible. A common solution is sampled softmax, which approximates the full softmax using a ...
Added: November 19, 2025
Nikita Severin, Savchenko A., Kiselev D. et al., , in: RecSys '23: Proceedings of the 17th ACM Conference on Recommender Systems.: Association for Computing Machinery (ACM), 2023.
Recommender systems are essential for personalized content delivery and have become increasingly popular recently. However, traditional recommender systems are limited in their ability to capture complex relationships between users and items. Dynamic graph neural networks (DGNNs) have recently emerged as a promising solution for improving recommender systems by incorporating temporal and sequential information in dynamic ...
Added: May 22, 2025
Shevchenko V., Belousov N., Vasilev A. et al., , in: KDD '24: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.: Association for Computing Machinery (ACM), 2024. P. 5701–5712.
In the rapidly evolving domain of Recommender Systems (RecSys), new algorithms frequently claim state-of-the-art performance based on evaluations over a limited set of arbitrarily selected datasets. However, this approach may fail to holistically reflect their effectiveness due to the significant impact of dataset characteristics on algorithm performance. Addressing this deficiency, this paper introduces a novel ...
Added: November 24, 2024
Evgeny Frolov, Tatyana Matveeva, Мирвахабова Л. et al., , in: RecSys '24: Proceedings of the 18th ACM Conference on Recommender Systems.: Association for Computing Machinery (ACM), 2024. P. 981–986.
Added: September 10, 2024
Orekhov B., / Series Computer Science "arxiv.org". 2024.
In this paper, I apply linguistic methods of analysis to non-linguistic data, chess plays, metaphorically equating one with the other and seeking analogies. Chess game notations are also a kind of text, and one can consider the records of moves or positions of pieces as words and statements in a certain language. In this article ...
Added: August 8, 2024
Lashinin O., Bykov K., Ananyeva M. et al., , in: Proceedings of the Fifth Knowledge-aware and Conversational Recommender Systems Workshop co-located with 17th ACM Conference on Recommender Systems (RecSys 2023)Vol. 3560.: CEUR Workshop Proceedings, 2023. P. 35–43.
Recent advances in large language models have extended their potential use cases to different domains. Models such as ChatGPT have an extensive internal knowledge base that enables them to provide answers to various domain-specific queries. In this paper, we explore the potential use of OpenAI’s GPT3.5 model as a conversational recommender system. We designed a ...
Added: December 2, 2023
Frolov E., Oseledets I., Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 2017 Vol. 7 No. 3
Added: November 16, 2023
Frolov E., Oseledets I., IEEE Access 2023 Vol. 11 P. 6357–6371
Self-attentive transformer models have recently been shown to solve the next item recommendation task very efficiently. The learned attention weights capture sequential dynamics in user behavior and generalize well. Motivated by the special structure of learned parameter space, we question if it is possible to mimic it with an alternative and more lightweight approach. We ...
Added: November 16, 2023
Ali N., Alshahrani A., Alghamdi A. et al., Applied Sciences (Switzerland) 2022 Vol. 12 No. 17 Article 8823
Online customers’ opinions represent a significant resource for both customers and enterprises to extract much information that helps them make the right decision. Finding relevant data while searching the internet is a big challenge for web users, known as the “Problem of Information Overload”. Recommender systems have been recognized as a promising way of solving ...
Added: October 4, 2022
Anton Begehr, Peter Panfilov, , in: ICCTA '22: Proceedings of the 2022 8th International Conference on Computer Technology Applications.: NY: Association for Computing Machinery (ACM), 2022. Ch. 19 P. 121–127.
In this work, we explore the application of graph embedding to the design and development of a friend recommender system for the users of the social network. Graph embedding could be useful for recommendation tasks because of data compression, the feature vector format, and sub-quadratic time complexity of graph embedding. We suggest and study a ...
Added: September 26, 2022
Kiselev D., Makarov I., IEEE Access 2022 Vol. 10 P. 123614–123621
Temporal graph networks are powerful tools for solving the cold-start problem in sequential recommender systems. However, graph models are susceptible to feedback loops and data distribution shifts. The paper proposes a simple yet efficient graph-based exploration method for the mitigation of the issues above. It adopts the counter-based state exploration from reinforcement learning to the ...
Added: September 5, 2022