EDBT 2026 Demo / reviewers in the wild / expert
Xinyue Chen 0005
dblp:124/5261-5
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0003-5015-1579ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 67% Data mining · 33% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › retrieval models › neural retrieval › dense retrieval
contrastive learning for retrieval |
0.8 | 1 | 2024 | Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024 |
Information retrieval › text analysis
name disambiguation |
0.8 | 1 | 2024 | Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024 |
Data mining
representation learning |
0.8 | 1 | 2024 | Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024 |
Machine learning › Graph learning › graph structure learning
graph structure refinement |
0.2 | 1 | 2024 | Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive Embedding · WWW 2024 |
Methods — techniques the papers use, named apart from their topics
graph refinement · 1.5contrastive learning · 1.5compositional embedding · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Author Name Disambiguation via Paper Association Refinement and Compositional Contrastive EmbeddingabstractAuthor name disambiguation (AND) is an essential task for online academic retrieval systems. Recent models adopt representation learning in the author's name disambiguation. Despite achieving remarkable success, these methods may be limited in two aspects. First, the heuristically constructed paper association graphs used for representation learning contain uncertainties that may cause negative supervision. Second, existing algorithms, such as binary cross-entropy loss, used to train representation learning models may not produce sufficiently high-quality representations for AND. To tackle the above problems, we propose an association refining and compositional contrasting (ARCC) framework for AND tasks. ARCC first adopts an iterative graph structure refinement process to dynamically reduce the uncertainties in paper graphs. Then, a compositional contrastive learning method is proposed to encourage learning more discriminative representations for AND. Empirical studies on two benchmark datasets suggest that ARCC is effective for AND and outperforms the state-of-the-art models. Dezhi Liu, Richong Zhang, Junfan Chen 0001, Xinyue Chen 0005 |
WWW | 4 |