• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • Ti-DC-GNN: Incorporating Time-Interval Dual Graphs for Recommender Systems
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
April 28, 2026
Scientists Develop Algorithm for Accurate Financial Time Series Forecasting
Researchers at the HSE Faculty of Computer Science benchmarked more than 200,000 model configurations for predicting financial asset prices and realised volatility, showing that performance can be improved by filtering out noise at specific frequencies in advance. This technique increased accuracy in 65% of cases. The authors also developed their own algorithm, which achieves accuracy comparable to that of the best models while requiring less computational power. The study has been published in Applied Soft Computing.
April 27, 2026
Fair Division: How Mathematics Helps to Divide the Indivisible
How can items be allocated among participants so that no one feels short-changed? Alexander Karpov, Assistant Professor at the Faculty of Economic Sciences, and his Singaporean colleague, Prof. Warut Suksompong, set out to find a mathematical answer to this question. In this interview, they discuss how a model of rational preferences is constructed, why one cannot rely on a simple sum of values, and where an algorithm that asks a minimal number of questions can be useful.
April 24, 2026
Electronics of the Future: Why Superconductors and Spintronics Work Together
It was once believed that superconductivity and magnetism avoided each other like the devil avoids holy water. However, modern nanostructures prove the opposite. A Russian theoretical physicist and Indian experimentalists have joined forces to create the electronics of the future—free from energy losses. Nataliya Pugach, Professor at the School of Electronic Engineering at HSE MIEM and Leading Research Fellow at the Quantum Nanoelectronics Laboratory, explains how a long-standing acquaintance in Cambridge grew into a mirror laboratory project with the Indian Institute of Technology Bombay (IIT Bombay), how superconducting spintronics works, and what surprises a researcher in India beyond the university campus.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Ti-DC-GNN: Incorporating Time-Interval Dual Graphs for Recommender Systems

.
Nikita Severin, Savchenko A., Kiselev D., Maria I., Ivan K., Makarov I.

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 graphs. In this paper, we propose a novel method, "Ti-DC-GNN" (Time-Interval Dual Causal Graph Neural Networks), based on an intermediate representation of graph evolution as a sequence of time-interval graphs. The main parts of the method are the novel forms of interval graphs: graph of causality and graph of consequence that explicitly preserve inter-relationships between edges (user-items interactions). The local and global message passing are developed based on edge memory to identify short-term and long-term dependencies. Experiments on several well-known datasets show that our method consistently outperforms modern temporal GNNs with node memory alone in dynamic edge prediction tasks.

Language: English
DOI
Keywords: Recommender Systemsgraph neural networks (GNNs)

In book

RecSys '23: Proceedings of the 17th ACM Conference on Recommender Systems
Association for Computing Machinery (ACM), 2023.
Similar publications
Efficient Incorporation of New Interactions in Graph Recommenders via Folding-In
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
Efficient Incorporation of New Interactions in Graph Recommenders via Folding-In
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
Efficient Incorporation of New Interactions in Graph Recommenders via Folding-In
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
An Analysis of Sequential Patterns in Datasets for Evaluation of Sequential Recommendations
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
Autoregressive generation strategies for Top-K sequential recommendations
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
Encode Me If You Can: Learning Universal User Representations via Event Sequence Autoencoding
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
Benefiting from Negative yet Informative Feedback by Contrasting Opposing Sequential Patterns
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
Let It Go? Not Quite: Addressing Item Cold Start in Sequential Recommendations with Content-Based Initialization
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
32nd SIGKDD Conference on Knowledge Discovery and Data Mining
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
Blending Sequential Embeddings, Graphs, and Engineered Features: 4th Place Solution in RecSys Challenge 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
RecSysChallenge '25: Proceedings of the Recommender Systems Challenge 2025
Association for Computing Machinery (ACM), 2025.
Added: November 19, 2025
Correcting the LogQ Correction: Revisiting Sampled Softmax for Large-Scale Retrieval
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
Dimension-Augmented Anisotropy in Graph Neural Diffusion
Sycheva T., Beketov M., Smolyar I., , in: Artificial Neural Networks and Machine Learning. ICANN 2025 International Workshops and Special Sessions: 34th International Conference on Artificial Neural Networks, Kaunas, Lithuania, September 9–12, 2025, Proceedings, Part V.: Cham: Springer, 2025. Ch. 4 P. 29–33.
We consider Graph Anisotropic Diffusion (GAD), a recently proposed model of graph neural networks, that can be trained to predict desired properties of the graph by performing learnable diffusion of node features on it. In contrast with similar methods, GAD introduces anisotropy of said diffusion by incorporating filters built from the graph’s Fiedler vector. In ...
Added: September 29, 2025
From Variability to Stability: Advancing RecSys Benchmarking Practices
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
Self-Attentive Sequential Recommendations with Hyperbolic Representations
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
Эффективное обучение графовых сетей на многомерных многослойных представлениях табличных данных
D'yakonov A., Меведев А. В., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2023 Т. 514 № 2 С. 118–125
For prediction tasks using tabular data, it is possible to extract additional information about the target variable by examining the relationships between the objects. Specifically, if it is possible to receive agraph in which the objects are represented as vertices and the relationships are expressed as edges, then it is likely that the graph structure contains valuable ...
Added: March 18, 2024
A critical look at the evaluation of GNNs under heterophily: are we really making progress?
Oleg Platonov, Denis Kuznedelev, Michael Diskin et al., , in: Proceedings of the 11th International Conference on Learning Representations (ICLR 2023).: ICLR, 2023.
Added: December 28, 2023
GPT3RecBot: a universal chatbot recommender of movies, books and music in Telegram
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
Tensor methods and recommender systems
Frolov E., Oseledets I., Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 2017 Vol. 7 No. 3
Added: November 16, 2023
Tensor-Based Sequential Learning via Hankel Matrix Representation for Next Item Recommendations
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
SmartTips: Online Products Recommendations System Based on Analyzing Customers Reviews
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
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit