Demo Data from EDBT 2026 / reviewers in the wild / expert
Liang Du 0006
dblp:40/5548-6
· DBLP profile ↗
6ranked-venue papers
2as first author
6since 2021 · last 2026
0009-0001-4847-4075ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 2 first-author · 6 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.
| Artificial intelligence
1 paper |
Graph learning · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network
dynamic graph neural network |
0.8 | 1 | 2024 | Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs · KDD 2024 |
Machine learning › Graph learning
graph neural network |
0.8 | 1 | 2024 | Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs · KDD 2024 |
Computational geometry › topological data analysis
persistent homology |
0.8 | 1 | 2024 | Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs · KDD 2024 |
Computational geometry
topological data analysis |
0.8 | 1 | 2024 | Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs · KDD 2024 |
Machine learning › Graph learning › graph classification
dynamic graph classification |
0.2 | 1 | 2024 | Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs · KDD 2024 |
Machine learning › Graph learning
graph classification |
0.2 | 1 | 2024 | Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs · KDD 2024 |
Methods — techniques the papers use, named apart from their topics
topological data analysis · 1.5persistent homology · 1.5line graph transformation · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Beyond structural balance: Imbalance-aware embedding for signed networks
Liang Du 0006, Hao Jiang 0010, Hao Li 0080 |
Expert Syst. Appl. | 1 |
| 2026 | TDiscNet: Topological discrepancy-guided adaptive semantic modeling for dynamic text-attributed graphs
Hao Li 0080, Liang Du 0006, Yixue Huang, Hao Jiang 0010 |
Knowl. Based Syst. | 2 |
| 2025 | Simplex bounded confidence model for opinion fusion and evolution in higher-order interaction
Dongsheng Ye, Hao Jiang 0010, Liang Du 0006, Hao Li 0080, Qimei Chen |
Expert Syst. Appl. | 4 |
| 2024 | Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed GraphsabstractPersistent homology, a fundamental technique within Topological Data Analysis (TDA), captures structural and shape characteristics of graphs, yet encounters computational difficulties when applied to dynamic directed graphs. This paper introduces the Dynamic Neural Dowker Network (DNDN), a novel framework specifically designed to approximate the results of dynamic Dowker filtration, aiming to capture the high-order topological features of dynamic directed graphs. Our approach creatively uses line graph transformations to produce both source and sink line graphs, highlighting the shared neighbor structures that Dowker complexes focus on. The DNDN incorporates a Source-Sink Line Graph Neural Network (SSLGNN) layer to effectively capture the neighborhood relationships among dynamic edges. Additionally, we introduce an innovative duality edge fusion mechanism, ensuring that the results for both the sink and source line graphs adhere to the duality principle intrinsic to Dowker complexes. Our approach is validated through comprehensive experiments on real-world datasets, demonstrating DNDN's capability not only to effectively approximate dynamic Dowker filtration results but also to perform exceptionally in dynamic graph classification tasks. Hao Li 0080, Hao Jiang 0010, Jiajun Fan, Dongsheng Ye, Liang Du 0006 |
KDD | 5 |
| 2024 | An unclosed structures-preserving embedding model for signed networks
Liang Du 0006, Hao Jiang 0010, Dongsheng Ye, Hao Li 0080 |
Neurocomputing | 1 |
| 2024 | DHGAT: Hyperbolic representation learning on dynamic graphs via attention networks
Hao Li 0080, Hao Jiang 0010, Dongsheng Ye, Qiang Wang 0027, Liang Du 0006, Yuanyuan Zeng 0001 |
Neurocomputing | 5 |