Hanjing Lin

dblp:368/3159 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0000-9865-6259ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Graph learning · 40% Trustworthy machine learning · 40% Representation and self-supervised learning · 20%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability
causal explanation
0.912025
Incorporating Retrieval-based Causal Learning with Information Bottlenecks for Interpretable Molecular Graph Learning · KDD (2) 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
Multi-modal Contrastive Learning with Negative Sampling Calibration for Phenotypic Drug Discovery · CVPR 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Incorporating Retrieval-based Causal Learning with Information Bottlenecks for Interpretable Molecular Graph Learning · KDD (2) 2025
Machine learning › Graph learning › graph neural network › trustworthy graph neural networks
interpretable graph neural network
0.912025
Incorporating Retrieval-based Causal Learning with Information Bottlenecks for Interpretable Molecular Graph Learning · KDD (2) 2025
Machine learning › Graph learning › molecular representation learning
molecular graph learning
0.912025
Incorporating Retrieval-based Causal Learning with Information Bottlenecks for Interpretable Molecular Graph Learning · KDD (2) 2025
Bioinformatics and computational biology
drug discovery
0.312025
Incorporating Retrieval-based Causal Learning with Information Bottlenecks for Interpretable Molecular Graph Learning · KDD (2) 2025

Methods — techniques the papers use, named apart from their topics

retrieval-based learning · 1.7multimodal fusion · 1.7graph information bottleneck · 1.7contrastive learning · 1.7causal learning · 1.7
YearPublicationVenuePosition
2025 Multi-modal Contrastive Learning with Negative Sampling Calibration for Phenotypic Drug Discovery
abstract
Phenotypic drug discovery presents a promising strategy for identifying first-in-class drugs by bypassing the need for specific drug targets. Recent advances in cell-based phenotypic screening tools, including Cell Painting and the LINCS L1000, provide essential cellular data that capture biological responses to compounds. While the integration of the multi-modal data enhances the use of contrastive learning (CL) methods for molecular phenotypic representation, these approaches treat all negative pairs equally, failing to discriminate molecules with similar phenotypes. To address these challenges, we introduce a foundational framework MINER that dynamically estimates the likelihoods of sample pairs as negative pairs based on uni-modal disentangled representations. In addition, our approach incorporates a mixture fusion strategy to effectively integrate multimodal data, even in cases where certain modalities are missing. Extensive experiments demonstrate that our method enhances both molecular property prediction and molecule-phenotype retrieval accuracy. Moreover, it successfully recommends drug candidates from phenotype for complex diseases documented in the literature. These findings underscore MINER’s potential to advance drug discovery by enabling deeper insights into disease mechanisms and improving drug candidate recommendations.
Jiahua Rao, Hanjing Lin, Leyu Chen, Jiancong Xie, Shuangjia Zheng, Yuedong Yang
CVPR2
2025 Incorporating Retrieval-based Causal Learning with Information Bottlenecks for Interpretable Molecular Graph Learning
abstract
Graph Neural Networks (GNNs) have gained considerable traction for modeling molecular structures and predicting properties, but their interpretability remains a significant challenge in understanding chemical behaviors. Current interpretation methods often rely on post-hoc explanations, which aim to provide transparency in GNN decisions. However, these approaches struggle with interpreting complex subgraphs and fail to leverage explanations to enhance predictive capabilities. While transparent methods can enhance GNN predictions, they typically compromise on explanation precision. This limitation underscores the need for a new strategy that effectively integrates GNN explanations and predictions. In this study, we have developed a novel interpretable causal GNN framework that combines retrieval-based causal learning with Graph Information Bottleneck (GIB) theory. Our framework semi-parametrically identifies crucial subgraphs through GIB and compresses explanatory subgraphs using a causal module. The framework consistently outperformed state-of-the-art methods, achieving a 32.72% increase in precision for scientific explanation tasks involving diverse substructures. More importantly, the learned explanations were also shown to be able to improve GNN prediction performance. This advancement is particularly vital for molecular graph learning, as it addresses the critical need to interpret how molecular structures influence predicted properties, thereby aiding drug discovery and materials science by providing insights into chemical mechanisms.
Jiahua Rao, Hanjing Lin, Jiancong Xie, Zhen Wang 0036, Shuangjia Zheng, Yuedong Yang
KDD (2)2