Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tanishq Dubey

dblp:220/3210 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0008-5056-6471ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

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.

Artificial intelligence
1 paper
Graph learning · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 50% Graph data management · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
dynamic graph neural network
0.912025
MINTT: Memory Inductive Transfer for Temporal Graph Neural Networks · SIGIR 2025
Recommender systems
sequential recommendation
0.312025
MINTT: Memory Inductive Transfer for Temporal Graph Neural Networks · SIGIR 2025
Graph data management › temporal graph
temporal interaction networks
0.312025
MINTT: Memory Inductive Transfer for Temporal Graph Neural Networks · SIGIR 2025

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

transfer learning · 1.7bipartite encoding · 1.7
YearPublicationVenuePosition
2025 MINTT: Memory Inductive Transfer for Temporal Graph Neural Networks
abstract
Interactions between entities are often time-dependent in real-world systems such as e-commerce, social networks, streaming platforms, finance, and healthcare, and are best modeled as temporal interaction graphs. The temporal dimension plays a crucial role in modern recommendation systems, which rely on future link predictions. Temporal Graph Neural Networks (TGNN) have demonstrated state-of-the-art performance in future link prediction tasks for temporal interaction graphs. However, these models often require substantial training data unavailable in real-world settings. A potential solution to data scarcity is model pre-training on semantically related datasets. Unfortunately, transferring the TGNN model from one dataset to another is not trivial, as it contains node-specific memory modules vital for performance, resulting in them being inherently non-transferable. To overcome this limitation, we propose a novel transfer method that effectively utilizes common attributes between source and target datasets by decoupling graph nodes and corresponding attributes via bipartite encoding. This decoupling facilitates the transfer of memories and other inductive biases from source datasets to a target dataset. We evaluate the proposed transfer technique on real-world datasets and establish that it improves the performance of TGNN on the target dataset by 56% compared to the no-transfer methods and 36% over the state-of-the-art baselines in data-scarce settings.
Tanishq Dubey, Sidharth Agarwal, Srikanta J. Bedathur
SIGIR1