Demo Data from SIGIR 2026 / reviewers in the wild / expert
Lulu Wang 0011
dblp:28/1751-11
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-5584-2908ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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 · 77% Knowledge graphs · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › evaluation
benchmark |
0.8 | 1 | 2024 | OAG-Bench: A Human-Curated Benchmark for Academic Graph Mining · KDD 2024 |
Knowledge graphs › domain-specific knowledge graph
academic knowledge graph |
0.2 | 1 | 2024 | OAG-Bench: A Human-Curated Benchmark for Academic Graph Mining · KDD 2024 |
Methods — techniques the papers use, named apart from their topics
large language model · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | OAG-Bench: A Human-Curated Benchmark for Academic Graph MiningabstractWith the rapid proliferation of scientific literature, versatile academic knowledge services increasingly rely on comprehensive academic graph mining. Despite the availability of public academic graphs, benchmarks, and datasets, these resources often fall short in multi-aspect and fine-grained annotations, are constrained to specific task types and domains, or lack underlying real academic graphs. In this paper, we present OAG-Bench, a comprehensive, multi-aspect, and fine-grained human-curated benchmark based on the Open Academic Graph (OAG). OAG-Bench covers 10 tasks, 20 datasets, 70+ baselines, and 120+ experimental results to date. We propose new data annotation strategies for certain tasks and offer a suite of data pre-processing codes, algorithm implementations, and standardized evaluation protocols to facilitate academic graph mining. Extensive experiments reveal that even advanced algorithms like large language models (LLMs) encounter difficulties in addressing key challenges in certain tasks, such as paper source tracing and scholar profiling. We also introduce the Open Academic Graph Challenge (OAG-Challenge) to encourage community input and sharing. We envisage that OAG-Bench can serve as a common ground for the community to evaluate and compare algorithms in academic graph mining, thereby accelerating algorithm development and advancement in this field. OAG-Bench is accessible at https://www.aminer.cn/data/. Fanjin Zhang, Yifan Zhu 0001, Bo Chen 0026, Yukuo Cen, Jifan Yu, Yelin Chen, Lulu Wang 0011, Qingfei Zhao, Yuqing Cheng, Yuwei An, Weng Lam Tam, Yunhe Pang 0001, Huihui Yuan, Jian Song 0016, Yuxiao Dong, Jie Tang 0001 |
KDD | 8 |
| 2024 | Syntax-guided controllable sentence simplification
Lulu Wang 0011, Aishan Wumaier, Tuergen Yibulayin, Maihemuti Maimaiti |
Neurocomputing | 1 |