EDBT 2026 Demo / reviewers in the wild / expert
Yuchen Ying
dblp:341/3164
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, 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.
| Artificial intelligence
2 papers |
Time series and sequential data · 29% Learning paradigms · 29% Graph learning · 25% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Graph data management · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 9 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms › class imbalance
long-tailed learning |
1.0 | 1 | 2026 | Adaptive Location Hierarchy Learning for Long-Tailed Mobility Prediction · WWW 2026 |
Machine learning › Time series and sequential data › spatiotemporal forecasting
mobility prediction |
1.0 | 1 | 2026 | Adaptive Location Hierarchy Learning for Long-Tailed Mobility Prediction · WWW 2026 |
Graph data management › graph pattern matching
subgraph matching |
1.0 | 1 | 2026 | Neural Graph Navigation for Intelligent Subgraph Matching · AAAI 2026 |
Graph algorithms and graph theory › graph algorithms
graph pattern matching |
1.0 | 1 | 2026 | Neural Graph Navigation for Intelligent Subgraph Matching · AAAI 2026 |
Machine learning › Graph learning
molecular representation learning |
0.9 | 1 | 2025 | Association Pattern-enhanced Molecular Representation Learning · AAAI 2025 |
Bioinformatics and computational biology
molecular property prediction |
0.9 | 1 | 2025 | Association Pattern-enhanced Molecular Representation Learning · AAAI 2025 |
Bioinformatics and computational biology › network bioinformatics
biological network analysis |
0.8 | 1 | 2024 | Association Pattern-aware Fusion for Biological Entity Relationship Prediction · NeurIPS 2024 |
Bioinformatics and computational biology
drug discovery |
0.8 | 1 | 2024 | Association Pattern-aware Fusion for Biological Entity Relationship Prediction · NeurIPS 2024 |
Natural language and speech › Language models and text generation
prompting |
0.3 | 1 | 2026 | Adaptive Location Hierarchy Learning for Long-Tailed Mobility Prediction · WWW 2026 |
Methods — techniques the papers use, named apart from their topics
message passing · 2.5neuro-heuristic search · 2.0neural navigation · 2.0self-supervised learning · 1.7large language model · 1.0gumbel disturbance · 1.0chain-of-thought prompting · 1.0graph neural network · 0.8bind-relation module · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Neural Graph Navigation for Intelligent Subgraph MatchingabstractSubgraph matching, a cornerstone of relational pattern detection in domains ranging from biochemical systems to social network analysis, faces significant computational challenges due to the dramatically growing search space. Existing methods address this problem within a filtering-ordering-enumeration framework, in which the enumeration stage recursively matches the query graph against the candidate subgraphs of the data graph. However, the lack of awareness of subgraph structural patterns leads to a costly brute-force enumeration, thereby critically motivating the need for intelligent navigation in subgraph matching. To address this challenge, we propose Neural Graph Navigation (NeuGN), a neuro-heuristic framework that transforms brute-force enumeration into neural-guided search by integrating neural navigation mechanisms into the core enumeration process. By preserving heuristic-based completeness guarantees while incorporating neural intelligence, NeuGN significantly reduces the First Match Steps by up to 98.2% compared to state-of-the-art methods across six real-world datasets. Yuchen Ying, Yiyang Dai, Wenda Li 0003, Rui Wang 0076, Tongya Zheng, Yu Wang 0176, Hanyang Yuan, Mingli Song |
AAAI | 1 |
| 2026 | Adaptive Location Hierarchy Learning for Long-Tailed Mobility PredictionabstractHuman mobility prediction is crucial for applications ranging from location-based recommendations to urban planning, which aims to forecast users' next location visits based on historical trajectories. While existing mobility prediction models excel at capturing sequential patterns through diverse architectures for different scenarios, they are hindered by the long-tailed distribution of location visits, leading to biased predictions and limited applicability. This highlights the need for a solution that enhances the long-tailed prediction capabilities of these models with broad compatibility and efficiency across diverse architectures. To address this need, we propose the first architecture-agnostic plugin for long-tailed human mobility prediction, named \textbf{A}daptive \textbf{LO}cation \textbf{H}ier\textbf{A}rchy learning (ALOHA). Inspired by Maslow's theory of human motivation, we exploit and explore common mobility knowledge of head and tail locations derived from human mobility trajectories to effectively mitigate long-tailed bias. Specifically, we introduce an automatic pipeline to construct city-tailored location hierarchies based on Large Language Models (LLMs) and Chain-of-Thought (CoT) prompts, capturing high-level mobility semantics with minimal human verification. We further design an Adaptive Hierarchical Loss (AHL) that rebalances learning through Gumbel disturbance and node-wise adaptive weighting, enabling both exploitation of multi-level signals and exploration within semantically related groups. Extensive experiments across multiple state-of-the-art models demonstrate that ALOHA consistently improves long-tailed mobility prediction performance by up to 16.59\% while maintaining efficiency and robustness. Our code is at https://github.com/Star607/ALOHA. Yu Wang 0176, Junshu Dai, Yuchen Ying, Hanyang Yuan, Zunlei Feng, Tongya Zheng, Mingli Song |
WWW | 3 |
| 2025 | Association Pattern-enhanced Molecular Representation LearningabstractThe applicability of drug molecules in various clinical scenarios is significantly influenced by a diverse range of molecular properties. By leveraging self-supervised conditions such as atom attributes and interatomic bonds, existing advanced molecular foundation models can generate expressive representations of these molecules. However, such models often overlook the fixed association patterns within molecules that influence physiological or chemical properties. In this paper, we introduce a novel association pattern-aware message passing method, which can serve as an effective yet general plug-and-play plugin, thereby enhancing the atom representations generated by molecular foundation models without requiring additional pretraining. Additionally, molecular property-specific pattern libraries are constructed to collect the generated interpretable common patterns that bind to these properties. Extensive experiments conducted on 11 benchmark molecular property prediction tasks across 8 advanced molecular foundation models demonstrate significant superiority of the proposed method, with performance improvements of up to approximately 20%. Furthermore, a property-specific pattern library is tailored for blood-brain barrier penetration, which has undergone corresponding mechanistic validation. Lingxiang Jia, Yuchen Ying, Shaolun Yao, Jie Lei 0002, Jie Song 0011, Mingli Song, Zunlei Feng |
AAAI | 2 |
| 2024 | Association Pattern-aware Fusion for Biological Entity Relationship PredictionabstractDeep learning-based methods significantly advance the exploration of associations among triple-wise biological entities (e.g., drug-target protein-adverse reaction), thereby facilitating drug discovery and safeguarding human health. However, existing researches only focus on entity-centric information mapping and aggregation, neglecting the crucial role of potential association patterns among different entities. To address the above limitation, we propose a novel association pattern-aware fusion method for biological entity relationship prediction, which effectively integrates the related association pattern information into entity representation learning. Additionally, to enhance the missing information of the low-order message passing, we devise a bind-relation module that considers the strong bind of low-order entity associations. Extensive experiments conducted on three biological datasets quantitatively demonstrate that the proposed method achieves about 4%-23% hit@1 improvements compared with state-of-the-art baselines. Furthermore, the interpretability of association patterns is elucidated in detail, thus revealing the intrinsic biological mechanisms and promoting it to be deployed in real-world scenarios. Our data and code are available at https://github.com/hry98kki/PatternBERP. Lingxiang Jia, Yuchen Ying, Zunlei Feng, Zipeng Zhong, Shaolun Yao, Jiacong Hu, Mingjiang Duan, Xingen Wang, Jie Song 0011, Mingli Song |
NeurIPS | 2 |