EDBT 2026 Demo / reviewers in the wild / expert
Yueming Yin
dblp:160/8947
· DBLP profile ↗
10ranked-venue papers
7as first author
9since 2021 · last 2025
0000-0002-9060-3248ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 4 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 4 · 3 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.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
2 papers |
Representation and self-supervised learning · 79% Graph learning · 21% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
drug discovery |
1.6 | 2 | 2025 | Enhancing Bioactivity Prediction via Spatial Emptiness Representation of Protein-ligand Complex and Union of Multiple Pockets · NeurIPS 2025 OLB-AC: toward optimizing ligand bioactivities through deep graph learning and activity cliffs · Bioinform. 2024 |
Machine learning › Representation and self-supervised learning › structured representation
molecular representation |
0.9 | 1 | 2025 | Enhancing Bioactivity Prediction via Spatial Emptiness Representation of Protein-ligand Complex and Union of Multiple Pockets · NeurIPS 2025 |
Bioinformatics and computational biology › drug discovery
bioactivity prediction |
0.9 | 1 | 2025 | Enhancing Bioactivity Prediction via Spatial Emptiness Representation of Protein-ligand Complex and Union of Multiple Pockets · NeurIPS 2025 |
Bioinformatics and computational biology › structural bioinformatics
protein-ligand binding |
0.9 | 1 | 2025 | Enhancing Bioactivity Prediction via Spatial Emptiness Representation of Protein-ligand Complex and Union of Multiple Pockets · NeurIPS 2025 |
Machine learning › Graph learning
graph neural network |
0.2 | 1 | 2024 | OLB-AC: toward optimizing ligand bioactivities through deep graph learning and activity cliffs · Bioinform. 2024 |
Methods — techniques the papers use, named apart from their topics
pairwise loss · 1.7geometric deep learning · 1.7deep graph learning · 1.5attentive graph reconstruction neural network · 1.5adversarial representation · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Enhancing Bioactivity Prediction via Spatial Emptiness Representation of Protein-ligand Complex and Union of Multiple PocketsabstractPredicting the bioactivity of candidate ligands remains a central challenge in drug discovery. Ligands and endogenous substrates often compete for the same binding sites on target proteins, and the extent to which a ligand can modulate protein function depends not only on its binding but also on how effectively it occupies the relevant pocket. However, most existing methods focus narrowly on local interactions within protein–ligand complexes and neglect spatial emptiness—the unoccupied regions within the binding site that may permit endogenous molecules to engage or interfere. Such unfilled space can diminish the ligand’s functional impact, regardless of binding affinity. To overcome this key limitation in protein–ligand modeling, we propose LigoSpace, a novel method integrating three core components. LigoSpace introduces GeoREC (Geometric Representation of Spatial Emptiness in Complexes) to quantify atomic-level empty space and Union-Pocket to unify multiple protein pockets, providing a global view of binding sites. Additionally, LigoSpace employs a pairwise loss instead of commonly used MSE loss, to better capture relative relationships critical for drug discovery. Extensive experiments on multiple datasets with diverse bioactivity types demonstrate that LigoSpace significantly improves performance when integrated into state-of-the-art models, highlighting the effectiveness of its novel components. Zhiyuan Zhou 0001, Yueming Yin, Yuguang Mu, Hoi-Yeung Li, Adams Wai-Kin Kong |
NeurIPS | 2 |
| 2024 | OLB-AC: toward optimizing ligand bioactivities through deep graph learning and activity cliffsabstractMOTIVATION: Deep graph learning (DGL) has been widely employed in the realm of ligand-based virtual screening. Within this field, a key hurdle is the existence of activity cliffs (ACs), where minor chemical alterations can lead to significant changes in bioactivity. In response, several DGL models have been developed to enhance ligand bioactivity prediction in the presence of ACs. Yet, there remains a largely unexplored opportunity within ACs for optimizing ligand bioactivity, making it an area ripe for further investigation. RESULTS: We present a novel approach to simultaneously predict and optimize ligand bioactivities through DGL and ACs (OLB-AC). OLB-AC possesses the capability to optimize ligand molecules located near ACs, providing a direct reference for optimizing ligand bioactivities with the matching of original ligands. To accomplish this, a novel attentive graph reconstruction neural network and ligand optimization scheme are proposed. Attentive graph reconstruction neural network reconstructs original ligands and optimizes them through adversarial representations derived from their bioactivity prediction process. Experimental results on nine drug targets reveal that out of the 667 molecules generated through OLB-AC optimization on datasets comprising 974 low-activity, noninhibitor, or highly toxic ligands, 49 are recognized as known highly active, inhibitor, or nontoxic ligands beyond the datasets' scope. The 27 out of 49 matched molecular pairs generated by OLB-AC reveal novel transformations not present in their training sets. The adversarial representations employed for ligand optimization originate from the gradients of bioactivity predictions. Therefore, we also assess OLB-AC's prediction accuracy across 33 different bioactivity datasets. Results show that OLB-AC achieves the best Pearson correlation coefficient (r2) on 27/33 datasets, with an average improvement of 7.2%-22.9% against the state-of-the-art bioactivity prediction methods. AVAILABILITY AND IMPLEMENTATION: The code and dataset developed in this work are available at github.com/Yueming-Yin/OLB-AC. Yueming Yin, Haifeng Hu 0004, Jitao Yang, Chun Ye, Wilson Wen Bin Goh, Adams Wai-Kin Kong |
Bioinform. | 1 |
| 2024 | Advancing Bioactivity Prediction Through Molecular Docking and Self-AttentionabstractBioactivity refers to the ability of a substance to induce biological effects within living systems, often describing the influence of molecules, drugs, or chemicals on organisms. In drug discovery, predicting bioactivity streamlines early-stage candidate screening by swiftly identifying potential active molecules. The popular deep learning methods in bioactivity prediction primarily model the ligand structure-bioactivity relationship under the premise of Quantitative Structure-Activity Relationship (QSAR). However, bioactivity is determined by multiple factors, including not only the ligand structure but also drug-target interactions, signaling pathways, reaction environments, pharmacokinetic properties, and species differences. Our study first integrates drug-target interactions into bioactivity prediction using protein-ligand complex data from molecular docking. We devise a Drug-Target Interaction Graph Neural Network (DTIGN), infusing interatomic forces into intermolecular graphs. DTIGN employs multi-head self-attention to identify native-like binding pockets and poses within molecular docking results. To validate the fidelity of the self-attention mechanism, we gather ground truth data from crystal structure databases. Subsequently, we employ these limited native structures to refine bioactivity prediction via semi-supervised learning. For this study, we establish a unique benchmark dataset for evaluating bioactivity prediction models in the context of protein-ligand complexes, showcasing the superior performance of our method (with an average improvement of 27.03%) through comparison with 9 leading deep learning-based bioactivity prediction methods. Yueming Yin, Hilbert Yuen In Lam, Yuguang Mu, Hoi-Yeung Li, Adams Wai-Kin Kong |
IEEE J. Biomed. Health Informatics | 1 |
| 2022 | AFSE: towards improving model generalization of deep graph learning of ligand bioactivities targeting GPCR proteinsabstractLigand molecules naturally constitute a graph structure. Recently, many excellent deep graph learning (DGL) methods have been proposed and used to model ligand bioactivities, which is critical for the virtual screening of drug hits from compound databases in interest. However, pharmacists can find that these well-trained DGL models usually are hard to achieve satisfying performance in real scenarios for virtual screening of drug candidates. The main challenges involve that the datasets for training models were small-sized and biased, and the inner active cliff cases would worsen model performance. These challenges would cause predictors to overfit the training data and have poor generalization in real virtual screening scenarios. Thus, we proposed a novel algorithm named adversarial feature subspace enhancement (AFSE). AFSE dynamically generates abundant representations in new feature subspace via bi-directional adversarial learning, and then minimizes the maximum loss of molecular divergence and bioactivity to ensure local smoothness of model outputs and significantly enhance the generalization of DGL models in predicting ligand bioactivities. Benchmark tests were implemented on seven state-of-the-art open-source DGL models with the potential of modeling ligand bioactivities, and precisely evaluated by multiple criteria. The results indicate that, on almost all 33 GPCRs datasets and seven DGL models, AFSE greatly improved their enhancement factor (top-10%, 20% and 30%), which is the most important evaluation in virtual screening of hits from compound databases, while ensuring the superior performance on RMSE and $r^2$. The web server of AFSE is freely available at http://noveldelta.com/AFSE for academic purposes. Yueming Yin, Haifeng Hu 0004, Zhen Yang 0001, Feihu Jiang, Yihe Huang |
Briefings Bioinform. | 1 |
| 2022 | Metric learning for domain adversarial network
Haifeng Hu 0004, Yueming Yin |
Frontiers Comput. Sci. | 3 |
| 2022 | Universal multi-Source domain adaptation for image classification
Yueming Yin, Zhen Yang 0001, Haifeng Hu 0004, Xiaofu Wu |
Pattern Recognit. | 1 |
| 2022 | Prediction of thawing settlement coefficient of frozen soil using 5G communication
Yueming Yin, Chaoqun Wei, Zhenghong Wang, Qinglu Deng |
Soft Comput. | 1 |
| 2021 | Metric-learning-assisted domain adaptation
Yueming Yin, Zhen Yang 0001, Haifeng Hu 0004, Xiaofu Wu |
Neurocomputing | 1 |
| 2021 | Pseudo-margin-based universal domain adaptation
Yueming Yin, Zhen Yang 0001, Xiaofu Wu, Haifeng Hu 0004 |
Knowl. Based Syst. | 1 |
| 2017 | A framework for security on demandabstractWith new technologies such as SDN(Software-Defined Networking) and NFV(Network Function Virtualization), network transformation is inevitable for network operators to make network programmable as well as to save cost. Consequently, applications can be deployed rapidly and automatically based on SDN and NFV. Correspondingly, security as one of key features for application also has to be provided dynamically and adaptively to meet different security requirements for today's rapid-increasing and evolving applications. However, traditional security appliances such as firewall are implemented as hardware-based middleboxes and placed on fixed locations in the network, so it is difficult to meet security requirements for today's applications. This paper proposes a new security service model based on security chain (i.e. security on demand) to provide customized security services dynamically and adaptively for today's applications. How to apply security on demand to the application (i.e. special vehicle speedup) is also elaborated. Yueming Yin |
IWCMC | 2 |