Demo Data from EDBT 2026 / reviewers in the wild / expert
Junlei Tang
dblp:395/3660
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Applied, 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 50% Computational science and engineering · 50% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational science and engineering › graph learning
graph neural network |
0.8 | 1 | 2024 | Chain-aware graph neural networks for molecular property prediction · Bioinform. 2024 |
Bioinformatics and computational biology
molecular property prediction |
0.8 | 1 | 2024 | Chain-aware graph neural networks for molecular property prediction · Bioinform. 2024 |
Machine learning › Graph learning
graph neural network |
0.2 | 1 | 2024 | Chain-aware graph neural networks for molecular property prediction · Bioinform. 2024 |
Methods — techniques the papers use, named apart from their topics
initial residual difference connection · 1.5attentive pooling · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Chain-aware graph neural networks for molecular property predictionabstractMOTIVATION: Predicting the properties of molecules is a fundamental problem in drug design and discovery, while how to learn effective feature representations lies at the core of modern deep-learning-based prediction methods. Recent progress shows expressive power of graph neural networks (GNNs) in capturing structural information for molecular graphs. However, we find that most molecular graphs exhibit low clustering along with dominating chains. Such topological characteristics can induce feature squashing during message passing and thus impair the expressivity of conventional GNNs. RESULTS: Aiming at improving node features' expressiveness, we develop a novel chain-aware graph neural network model, wherein the chain structures are captured by learning the representation of the center node along the shortest paths starting from it, and the redundancy between layers are mitigated via initial residual difference connection (IRDC). Then the molecular graph is represented by attentive pooling of all node representations. Compared to standard graph convolution, our chain-aware learning scheme offers a more straightforward feature interaction between distant nodes, thus it is able to capture the information about long-range dependency. We provide extensive empirical analysis on real-world datasets to show the outperformance of the proposed method. AVAILABILITY AND IMPLEMENTATION: The MolPath code is publicly available at https://github.com/Assassinswhh/Molpath. Honghao Wang 0001, Acong Zhang, Junlei Tang, Kai Zhang 0001, Ping Li 0024 |
Bioinform. | 4 |