Ivan Sukharev

dblp:257/0021 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0003-0157-3786ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › multimedia analysis and retrieval › music retrieval
music information retrieval
1.012026
From Queries to Playlists: An LLM-Driven Architecture for Semantic Music Search at Scale · SIGIR 2026
Information retrieval › search engines
search engine architecture
1.012026
From Queries to Playlists: An LLM-Driven Architecture for Semantic Music Search at Scale · SIGIR 2026
Computational finance and economics › credit risk
credit scoring
0.412020
EWS-GCN: Edge Weight-Shared Graph Convolutional Network for Transactional Banking Data · ICDM 2020
Machine learning › Graph learning › graph neural network
graph convolutional network
0.112020
EWS-GCN: Edge Weight-Shared Graph Convolutional Network for Transactional Banking Data · ICDM 2020
Machine learning › Graph learning
graph neural network
0.112020
EWS-GCN: Edge Weight-Shared Graph Convolutional Network for Transactional Banking Data · ICDM 2020

Methods — techniques the papers use, named apart from their topics

large language model · 1.0recurrent neural network · 0.9attention mechanism · 0.9
YearPublicationVenuePosition
2026 From Queries to Playlists: An LLM-Driven Architecture for Semantic Music Search at Scale
Rinat Mullakhmetov, Fedor Buzaev, Roman Bogachev, Ilya Sedunov, Oleg Pavlovich, Kamil Mazitov, Vladimir Kravtsov, Elena Tutubalina, Daria Pugacheva, Ivan Sukharev
SIGIR10
2020 Linking Bank Clients using Graph Neural Networks Powered by Rich Transactional Data: Extended Abstract
abstract
Each day bank clients conduct numerous operations, such as purchasing goods or transferring money to other clients. These interactions can be interpreted as a graph dynamically changing over time. This work focuses on the task of predicting new interactions in the network of bank clients and treats it as a link prediction problem. We propose an architecture for the graph convolutional network to efficiently solve the link prediction problem for this type of data. Our model uses recurrent neural networks to leverage the time-series data in both nodes and edges and effectively scales to the graphs with millions of nodes. We evaluate the model on the data provided for several years by a large European bank. The obtained results show that the model outperforms the existing approaches. The current paper is an extended abstract for the work [5].
Valentina Shumovskaia, Kirill Fedyanin, Ivan Sukharev, Dmitry Berestnev, Maxim Panov
DSAA3
2020 EWS-GCN: Edge Weight-Shared Graph Convolutional Network for Transactional Banking Data
abstract
In this paper, we discuss how modern deep learning approaches can be applied to the credit scoring of bank clients. We show that information about connections between clients based on money transfers between them allows us to significantly improve the quality of credit scoring compared to the approaches using information about the target client solely. As a final solution, we develop a new graph neural network model EWS-GCN that combines ideas of graph convolutional and recurrent neural networks via attention mechanism. The resulting model allows for robust training and efficient processing of large-scale data. We also demonstrate that our model outperforms the state-of-the-art graph neural networks achieving excellent results.
Ivan Sukharev, Valentina Shumovskaia, Kirill Fedyanin, Maxim Panov, Dmitry Berestnev
ICDM1