?
Boolean Matrix Factorisation for Collaborative Filtering: An FCA-Based Approach
P. 47–58.
We propose a new approach for Collaborative filtering which is based on Boolean Matrix Factorisation (BMF) and Formal Concept Analysis. In a series of experiments on real data (MovieLens dataset) we compare the approach with an SVD-based one in terms of Mean Average Error (MAE). One of the experimental consequences is that it is enough to have a binary-scaled rating data to obtain almost the same quality in terms of MAE by BMF as for the SVD-based algorithm in case of non-scaled data.
In book
Vol. 8722. , Dordrecht, L., Cham, Heidelberg, NY: Springer, 2014.
Springer, 2026.
Added: October 19, 2026
Grishina E., Stepan Kuznetsov, Tsyganov A. et al., , in: KDD '26: Proceedings of the 32th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.: Association for Computing Machinery (ACM), 2026. P. 1310–1321.
The ranking of recommendation algorithms is a challenging problem since model performance is sensitive to dataset characteristics such as sparsity, sequential structure, and scale. This drives a demand for a proper methodology for fair comparison between algorithms. Naive aggregation of performance metrics (e.g., averaging NDCG over benchmarks) can yield misleading rankings, undermining practical selection. To ...
Added: August 7, 2026
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
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
Ignatov D. I., , in: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers. Analysis of Images, Social Networks and Texts. Lecture Notes in Computer Science (LNCS, volume 14486).: Cham: Springer, 2024. P. 349 – 361.
This paper dates back to the asymptotic solutions of Rota’s problem on the size of maximum antichain in the set partition lattice by Canfield and Harper and others. The knowledge of asymptotic coefficients could pave the way to the asymptotic solutions of such problems as (maximal) antichain counting in partition lattices. In addition to our ...
Added: January 23, 2026
Khrylchenko K., Matveev A., Makeev S. et al., , in: KDD '26: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1Vol. 1.: Association for Computing Machinery (ACM), 2026. P. 2255–2265.
While large transformer models have been successfully used in many real-world applications such as natural language processing, computer vision, and speech processing, scaling transformers for recommender systems remains a challenging problem. Recently, Generative Recommenders framework was proposed to scale beyond typical Deep Learning Recommendation Models (DLRMs). Reformulation of recommendation as sequential transduction task led to ...
Added: November 25, 2025
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.
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
Vinogradov V., Журнал российского права 2024 Т. 28 № 9 С. 72–87
The rapid digitalization of all spheres of society has led to the transformation in the digital environment of existing human and civil rights and freedoms. Digitalization can not only change the specifics and conditions for the realization of basic rights, but also, and more importantly, affect their content, giving rights and freedoms a new (additional) ...
Added: October 3, 2024
Evgeny Frolov, Tatyana Matveeva, Mirvakhabova L. 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
Shirokov D., Advances in Applied Clifford Algebras 2024 Vol. 34 Article 23
In this paper, we present a natural implementation of singular value decomposition (SVD) and polar decomposition of an arbitrary multivector in nondegenerate real and complexified Clifford geometric algebras of arbitrary dimension and signature. The new theorems involve only operations in geometric algebras and do not involve matrix operations. We naturally define these and other related ...
Added: August 23, 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