Demo Data from EDBT 2026 / reviewers in the wild / expert
Yang Duan
dblp:194/8834
· DBLP profile ↗
6ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 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
2 papers |
Knowledge graphs · 43% Recommender systems · 38% Machine learning and data management · 19% | |
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs › knowledge graph querying
complex query answering |
0.9 | 1 | 2025 | Extending Complex Logical Queries on Uncertain Knowledge Graphs · ACL (1) 2025 |
Knowledge graphs
uncertain knowledge graph |
0.9 | 1 | 2025 | Extending Complex Logical Queries on Uncertain Knowledge Graphs · ACL (1) 2025 |
Recommender systems › cross-domain recommendation
cross-city recommendation |
0.8 | 1 | 2024 | Optimal Transport Enhanced Cross-City Site Recommendation · SIGIR 2024 |
Machine learning and data management
optimal transport |
0.8 | 1 | 2024 | Optimal Transport Enhanced Cross-City Site Recommendation · SIGIR 2024 |
Recommender systems › content recommendation
web page recommendation |
0.8 | 1 | 2024 | Optimal Transport Enhanced Cross-City Site Recommendation · SIGIR 2024 |
Methods — techniques the papers use, named apart from their topics
number embedding · 1.7forward inference · 1.7backward calibration · 1.7optimal transport · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Extending Complex Logical Queries on Uncertain Knowledge GraphsabstractThe study of machine learning-based logical query-answering enables reasoning with large-scale and incomplete knowledge graphs. This paper further advances this line of research by considering the uncertainty in the knowledge. The uncertain nature of knowledge is widely observed in the real world, but does not align seamlessly with the first-order logic underpinning existing studies. To bridge this gap, we study the setting of soft queries on uncertain knowledge, which is motivated by the establishment of soft constraint programming. We further propose an ML-based approach with both forward inference and backward calibration to answer soft queries on large-scale, incomplete, and uncertain knowledge graphs. Theoretical discussions reveal that our method ensures there are no catastrophic cascading errors in our forward inference algorithm while maintaining the same complexity as state-of-the-art inference algorithms for first-order queries. Empirical results justify the superior performance of our approach against previous ML-based methods with number embedding extensions. Weizhi Fei, Zihao Wang 0001, Hang Yin 0008, Yang Duan, Yangqiu Song |
ACL (1) | 4 |
| 2024 | Optimal Transport Enhanced Cross-City Site RecommendationabstractSite recommendation, which aims at predicting the optimal location for brands to open new branches, has demonstrated an important role in assisting decision-making in modern business. In contrast to traditional recommender systems that can benefit from extensive information, site recommendation starkly suffers from extremely limited information and thus leads to unsatisfactory performance. Therefore, existing site recommendation methods primarily focus on several specific name brands and heavily rely on fine-grained human-crafted features to avoid the data sparsity problem. However, such solutions are not able to fulfill the demand for rapid development in modern business. Therefore, we aim to alleviate the data sparsity problem by effectively utilizing data across multiple cities and thereby propose a novel Optimal Transport enhanced Cross-city (OTC) framework for site recommendation. Specifically, OTC leverages optimal transport (OT) on the learned embeddings of brands and regions separately to project the brands and regions from the source city to the target city. Then, the projected embeddings of brands and regions are utilized to obtain the inference recommendation in the target city. By integrating the original recommendation and the inference recommendations from multiple cities, OTC is able to achieve enhanced recommendation results. The experimental results on the real-world OpenSiteRec dataset, encompassing thousands of brands and regions across four metropolises, demonstrate the effectiveness of our proposed OTC in further improving the performance of site recommendation models. Xinhang Li 0001, Xiangyu Zhao 0001, Zihao Wang 0001, Yang Duan, Yong Zhang 0002, Chunxiao Xing |
SIGIR | 4 |
| 2024 | Toward a framework of extracting typical machining process routines based on knowledge representation learning
Jinjing Duan, Yang Duan |
Adv. Eng. Informatics | 2 |
| 2021 | Database Native Approximate Query Processing Based on Machine-Learning
Yang Duan, Yong Zhang 0002, Jiacheng Wu 0001 |
WISA | 1 |
| 2018 | Accounting Results Modelling with Neural Networks: The Case of an International Oil and Gas Company
Yang Duan, Chung-Hsing Yeh, David L. Dowe |
ICONIP (2) | 1 |
| 2017 | The power of the "like" button: The impact of social media on box office
Chao Ding 0007, Hsing Kenneth Cheng, Yang Duan, Yong Jimmy Jin |
Decis. Support Syst. | 3 |