VLDB 2026 Research / reviewers in the wild / expert
Zelin Dai
dblp:244/9645
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2023
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 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
4 papers |
Knowledge graphs · 90% Data integration and cleaning · 10% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 77% Transfer learning and domain adaptation · 23% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs
link prediction |
1.3 | 3 | 2023 | SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph Reasoning · EMNLP 2022 Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability · EMNLP (1) 2021 Construction and Applications of Billion-Scale Pre-Trained Multimodal Business Knowledge Graph · ICDE 2023 |
Knowledge graphs › knowledge graph reasoning
multi-hop reasoning |
1.1 | 2 | 2022 | SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph Reasoning · EMNLP 2022 Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability · EMNLP (1) 2021 |
Knowledge graphs
knowledge graph construction |
0.7 | 1 | 2023 | Construction and Applications of Billion-Scale Pre-Trained Multimodal Business Knowledge Graph · ICDE 2023 |
Knowledge graphs
knowledge graph pretraining |
0.7 | 1 | 2023 | Construction and Applications of Billion-Scale Pre-Trained Multimodal Business Knowledge Graph · ICDE 2023 |
Knowledge graphs
knowledge graph reasoning |
0.6 | 1 | 2022 | SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph Reasoning · EMNLP 2022 |
Machine learning › Trustworthy machine learning
interpretability |
0.5 | 1 | 2021 | Interpretable and Low-Resource Entity Matching via Decoupling Feature Learning from Decision Making · ACL/IJCNLP (1) 2021 |
Data integration and cleaning
entity matching |
0.5 | 1 | 2021 | Interpretable and Low-Resource Entity Matching via Decoupling Feature Learning from Decision Making · ACL/IJCNLP (1) 2021 |
Machine learning › Transfer learning and domain adaptation
low-resource learning |
0.1 | 1 | 2021 | Interpretable and Low-Resource Entity Matching via Decoupling Feature Learning from Decision Making · ACL/IJCNLP (1) 2021 |
Methods — techniques the papers use, named apart from their topics
feature learning decoupling · 1.0pre-training · 0.7multimodal representation learning · 0.7transformer · 0.6sequence-to-sequence learning · 0.6encoder-decoder · 0.6rule-based interpretability scoring · 0.5benchmark construction · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Construction and Applications of Billion-Scale Pre-Trained Multimodal Business Knowledge GraphabstractBusiness Knowledge Graphs (KGs) are important to many enterprises today, providing factual knowledge and structured data that steer many products and make them more intelligent. Despite their promising benefits, building business KG necessitates solving prohibitive issues of deficient structure and multiple modalities. In this paper, we advance the understanding of the practical challenges related to building KG in non-trivial real-world systems. We introduce the process of building an open business knowledge graph (OpenBG) derived from a well-known enterprise, Alibaba Group. Specifically, we define a core ontology to cover various abstract products and consumption demands, with fine-grained taxonomy and multimodal facts in deployed applications. OpenBG is an open business KG of unprecedented scale: 2.6 billion triples with more than 88 million entities covering over 1 million core classes/concepts and 2,681 types of relations. We release all the open resources (OpenBG benchmarks) derived from it for the community and report experimental results of KG-centric tasks. We also run up an online competition based on OpenBG benchmarks, and has attracted thousands of teams. We further pre-train OpenBG and apply it to many KG-enhanced downstream tasks in business scenarios, demonstrating the effectiveness of billion-scale multimodal knowledge for e-commerce. All the resources with codes have been released at https://github.com/OpenBGBenchmark/OpenBG. Shumin Deng, Zhoubo Li, Ningyu Zhang 0001, Zelin Dai, Hehong Chen, Feiyu Xiong, Ming Yan 0008, Mosha Chen, Jiaoyan Chen 0001, Jeff Z. Pan, Bryan Hooi, Huajun Chen |
ICDE | 5 |
| 2022 | SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph ReasoningabstractMulti-hop knowledge graph (KG) reasoning has been widely studied in recent years to provide interpretable predictions on missing links with evidential paths. Most previous works use reinforcement learning (RL) based methods that learn to navigate the path towards the target entity. However, these methods suffer from slow and poor convergence, and they may fail to infer a certain path when there is a missing edge along the path. Here we present SQUIRE, the first Sequence-to-sequence based multi-hop reasoning framework, which utilizes an encoder-decoder Transformer structure to translate the query to a path. Our framework brings about two benefits: (1) It can learn and predict in an end-to-end fashion, which gives better and faster convergence; (2) Our transformer model does not rely on existing edges to generate the path, and has the flexibility to complete missing edges along the path, especially in sparse KGs. Experiments on standard and sparse KGs show that our approach yields significant improvement over prior methods, while converging 4x-7x faster. Yushi Bai, Juan-Zi Li, Lei Hou 0001, Yincen Qu, Zelin Dai, Feiyu Xiong |
EMNLP | 6 |
| 2021 | Interpretable and Low-Resource Entity Matching via Decoupling Feature Learning from Decision MakingabstractZijun Yao, Chengjiang Li, Tiansi Dong, Xin Lv, Jifan Yu, Lei Hou, Juanzi Li, Yichi Zhang, Zelin Dai. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2021. Zijun Yao 0002, Chengjiang Li, Tiansi Dong, Jifan Yu, Lei Hou 0001, Juan-Zi Li, Yichi Zhang 0010, Zelin Dai |
ACL/IJCNLP (1) | 9 |
| 2021 | Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning InterpretabilityabstractMulti-hop reasoning has been widely studied in recent years to obtain more interpretable link prediction.However, we find in experiments that many paths given by these models are actually unreasonable, while little work has been done on interpretability evaluation for them.In this paper, we propose a unified framework to quantitatively evaluate the interpretability of multi-hop reasoning models so as to advance their development.In specific, we define three metrics, including path recall, local interpretability, and global interpretability for evaluation, and design an approximate strategy to calculate these metrics using the interpretability scores of rules.Furthermore, we manually annotate all possible rules and establish a Benchmark to detect the Interpretability of Multi-hop Reasoning (BIMR).In experiments, we verify the effectiveness of our benchmark.Besides, we run nine representative baselines on our benchmark, and the experimental results show that the interpretability of current multi-hop reasoning models is less satisfactory and is 51.7% lower than the upper bound given by our benchmark.Moreover, the rule-based models outperform the multi-hop reasoning models in terms of performance and interpretability, which points to a direction for future research, i.e., how to better incorporate rule information into the multihop reasoning model. Yixin Cao 0002, Lei Hou 0001, Juan-Zi Li, Zhiyuan Liu 0001, Yichi Zhang 0010, Zelin Dai |
EMNLP (1) | 7 |