Demo Data from EDBT 2026 / reviewers in the wild / expert
Lingxiang Jia
dblp:317/1151
· DBLP profile ↗
8ranked-venue papers
3as first author
8since 2021 · last 2025
0000-0001-6778-3458ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 3 first-author · 8 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 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
4 papers |
Graph learning · 39% Trustworthy machine learning · 23% Deep learning architectures and training · 23% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 11 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph anomaly detection
graph fraud detection |
0.9 | 1 | 2025 | Global Attribute-Association Pattern Aggregation for Graph Fraud Detection · AAAI 2025 |
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Global Attribute-Association Pattern Aggregation for Graph Fraud Detection · AAAI 2025 |
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 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.8 | 1 | 2024 | Improving Adversarial Robustness via Feature Pattern Consistency Constraint · IJCAI 2024 |
Machine learning › Representation and self-supervised learning › representation analysis
hidden state analysis |
0.8 | 1 | 2024 | Vision Mamba Mender · NeurIPS 2024 |
Machine learning › Trustworthy machine learning
interpretability |
0.8 | 1 | 2024 | Vision Mamba Mender · NeurIPS 2024 |
Machine learning › Deep learning architectures and training
state space model |
0.8 | 1 | 2024 | Vision Mamba Mender · NeurIPS 2024 |
Machine learning › Deep learning architectures and training › state space model
vision mamba |
0.8 | 1 | 2024 | Vision Mamba Mender · NeurIPS 2024 |
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 |
Methods — techniques the papers use, named apart from their topics
message passing · 3.4self-supervised learning · 1.7graph neural network · 1.6binning · 0.9predictive correlation analysis · 0.8correlation score · 0.8consistency constraint · 0.8bind-relation module · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Global Attribute-Association Pattern Aggregation for Graph Fraud DetectionabstractFraud is increasingly prevalent, and its patterns are frequently changing, posing challenges for fraud detection methods such as random forests and Graph Neural Networks (GNNs), which rely on bin-based and mixture features separately. The former may lose crucial graph-associated features, while the latter face incorrect feature fusion. To overcome these limitations, we propose an approach based on attribute-association pattern that leverages the distinct attribute and association patterns differentiating fraudulent from benign behaviors, to enhance fraud detection capabilities. Attribute features are adaptively split into separate bins to eliminate incorrect attribute fusion and combine association patterns through graph neighbor message passing, thereby deriving attribute-association pattern features. Using the learned attribute-association patterns, the fraud patterns between a single pattern and the patterns across the entire graph are globally aggregated. Extensive experiments comparing our approach with 24 methods on 7 datasets demonstrate that the proposed method achieves SOTA performance. Mingjiang Duan, Da He, Tongya Zheng, Lingxiang Jia, Mingli Song, Xinyu Wang 0001, Zunlei Feng |
AAAI | 4 |
| 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 | 1 |
| 2025 | TED-DTMoA: Tri-Comparison Expertise Decision for Drug-Target Mechanism of ActionabstractMachine-learned interactions between drugs and human protein targets play a crucial role in efficient and accurate drug discovery. However, the drug-target mechanism of action (DTMoA) prediction is actually a multi-class classification problem, which follows a long-tailed class distribution. Existing methods simply address whether the drugs and targets can interact and rarely consider these deep mechanisms. In this paper, we introduce TED-DTMoA, a novel DTMoA prediction framework that incorporates the divide-and-conquer strategy with tri-comparison options. Specifically, to reduce the learning difficulty of tail classes, we propose an expertise-based divide-and-conquer decision approach that combines the results of multiple independent expertise models for sub-tasks decomposed from the original prediction task. In addition, to enhance the discrimination of similar mechanism classes, we devise a tri-comparison learning strategy that defines the sub-task as the classification of triple options, such as expanding the classification task for classes A and B to include an extra “Neither of them” option. Extensive experiments conducted on various DTMoA datasets quantitatively demonstrate the proposed method achieves an approximately 13% performance improvement compared with advanced baselines. Moreover, our method exhibits an obvious superiority on the tail classes. Further analysis of the evolvability and generalization reveals the significant potential to be deployed in real-world scenes. Lingxiang Jia, Zipeng Zhong, Shaolun Yao, Jie Song 0011, Mingli Song, Zunlei Feng |
ECAI | 1 |
| 2024 | Improving Adversarial Robustness via Feature Pattern Consistency Constraint
Jiacong Hu, Jingwen Ye, Zunlei Feng, Jiazhen Yang, Shunyu Liu 0001, Xiaotian Yu, Lingxiang Jia, Mingli Song |
IJCAI | 7 |
| 2024 | Vision Mamba MenderabstractMamba, a state-space model with selective mechanisms and hardware-aware architecture, has demonstrated outstanding performance in long sequence modeling tasks, particularly garnering widespread exploration and application in the field of computer vision. While existing works have mixed opinions of its application in visual tasks, the exploration of its internal workings and the optimization of its performance remain urgent and worthy research questions given its status as a novel model. Existing optimizations of the Mamba model, especially when applied in the visual domain, have primarily relied on predefined methods such as improving scanning mechanisms or integrating other architectures, often requiring strong priors and extensive trial and error. In contrast to these approaches, this paper proposes the Vision Mamba Mender, a systematic approach for understanding the workings of Mamba, identifying flaws within, and subsequently optimizing model performance. Specifically, we present methods for predictive correlation analysis of Mamba's hidden states from both internal and external perspectives, along with corresponding definitions of correlation scores, aimed at understanding the workings of Mamba in visual recognition tasks and identifying flaws therein. Additionally, tailored repair methods are proposed for identified external and internal state flaws to eliminate them and optimize model performance. Extensive experiments validate the efficacy of the proposed methods on prevalent Mamba architectures, significantly enhancing Mamba's performance. Jiacong Hu, Anda Cao, Zunlei Feng, Shengxuming Zhang, Lingxiang Jia, Mingli Song |
NeurIPS | 6 |
| 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 | 1 |
| 2024 | Noise is the fatal poison: A Noise-aware Network for noisy dataset classification
Xiaotian Yu, Shengxuming Zhang, Lingxiang Jia, Mingli Song, Zunlei Feng |
Neurocomputing | 3 |
| 2022 | Chemical Property Relation Guided Few-Shot Molecular Property PredictionabstractThe ability of molecular property prediction is of great significance to drug discovery. However, molecular property prediction is essentially a few-shot problem, making it a challenge in deep learning applications in this scenario. Although some deep learning models, such as meta-learning, have been used in few-shot molecular property prediction, they neglect the relationships among different properties. In this paper, we introduce a chemical property relation modeling technique for generating the property relation map, which can guide the few-shot molecular property prediction with positively related properties. Some molecules sharing common properties are firstly picked out. Then, multiple property-aware graph neural networks are trained for extracting molecular representations from those molecules. Next, the Spearman's correlation is adopted to calculate the property relations with the property-aware matrix, which is built by calculating the pairwise similarity of the above molecular representations for each pair of properties. In the few-shot molecular property prediction task, the meta-learning strategy is adopted to learn common prediction knowledge from the meta-training categories, which are provided by the property relations. Extensive experiments on two public few-shot molecular property datasets demonstrate that the positively related properties are beneficial for the target property prediction, while negatively related properties have negative effects. With the guidance of positively related properties, the proposed method outperforms various state-of-the-art methods. Shaolun Yao, Zunlei Feng, Jie Song 0011, Lingxiang Jia, Zipeng Zhong, Mingli Song |
IJCNN | 4 |