VLDB 2026 Research / reviewers in the wild / expert
Sushant Rathi
dblp:264/4746
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 |
Knowledge graphs · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs
knowledge graph embedding |
0.4 | 1 | 2020 | Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols · EMNLP (1) 2020 |
Knowledge graphs
link prediction |
0.4 | 1 | 2020 | Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols · EMNLP (1) 2020 |
Knowledge graphs › knowledge graph embedding
temporal embedding |
0.4 | 1 | 2020 | Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols · EMNLP (1) 2020 |
Methods — techniques the papers use, named apart from their topics
temporal embedding · 0.4evaluation protocol design · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Temporal Knowledge Base Completion: New Algorithms and Evaluation ProtocolsabstractResearch on temporal knowledge bases, which associate a relational fact (s, r, o) with a validity time period (or time instant), is in its early days.Our work considers predicting missing entities (link prediction) and missing time intervals (time prediction) as joint Temporal Knowledge Base Completion (TKBC) tasks, and presents TIMEPLEX, a novel TKBC method, in which entities, relations and, time are all embedded in a uniform, compatible space.TIMEPLEX exploits the recurrent nature of some facts/events and temporal interactions between pairs of relations, yielding stateof-the-art results on both prediction tasks.We also find that existing TKBC models heavily overestimate link prediction performance due to imperfect evaluation mechanisms.In response, we propose improved TKBC evaluation protocols for both link and time prediction tasks, dealing with subtle issues that arise from the partial overlap of time intervals in gold instances and system predictions. Prachi Jain 0001, Sushant Rathi, Mausam, Soumen Chakrabarti |
EMNLP (1) | 2 |