Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yaosen Min

dblp:234/3816 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0003-4741-6188ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 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
3 papers
Graph learning · 50% Representation and self-supervised learning · 27% Generative modeling · 18%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 46% Computational science and engineering · 34% Medical and health informatics · 20%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.022025
MIPS: A Multimodal Infinite Polymer Sequence Pre-training Framework for Polymer Property Prediction · ACM Multimedia 2025
Multi-view Graph Contrastive Representation Learning for Drug-Drug Interaction Prediction · WWW 2021
Machine learning › Graph learning › graph neural network
message passing
0.912025
MIPS: A Multimodal Infinite Polymer Sequence Pre-training Framework for Polymer Property Prediction · ACM Multimedia 2025
Machine learning › Representation and self-supervised learning › pre-training
multimodal pretraining
0.912025
MIPS: A Multimodal Infinite Polymer Sequence Pre-training Framework for Polymer Property Prediction · ACM Multimedia 2025
Computational science and engineering
materials informatics
0.912025
MIPS: A Multimodal Infinite Polymer Sequence Pre-training Framework for Polymer Property Prediction · ACM Multimedia 2025
Machine learning › Generative modeling
molecular generation
0.712023
Molecule Generation For Target Protein Binding with Structural Motifs · ICLR 2023
Bioinformatics and computational biology › molecular informatics › cheminformatics
molecule generation
0.712023
Molecule Generation For Target Protein Binding with Structural Motifs · ICLR 2023
Bioinformatics and computational biology
contrastive learning
0.512021
Multi-view Graph Contrastive Representation Learning for Drug-Drug Interaction Prediction · WWW 2021
Medical and health informatics › drug safety
drug-drug interaction prediction
0.512021
Multi-view Graph Contrastive Representation Learning for Drug-Drug Interaction Prediction · WWW 2021
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.112021
Multi-view Graph Contrastive Representation Learning for Drug-Drug Interaction Prediction · WWW 2021

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

message passing mechanism · 1.7graph attention · 1.7cross-modal fusion · 1.7adversarial evaluation · 1.7structural motif conditioning · 1.3graph convolutional network · 1.0contrastive learning · 1.0attentive message passing · 1.0
YearPublicationVenuePosition
2025 MIPS: A Multimodal Infinite Polymer Sequence Pre-training Framework for Polymer Property Prediction
abstract
Polymers, composed of repeating structural units called monomers, are fundamental materials with a wide range of applications in daily life and industry. Accurate property prediction for polymers is essential for their design, development, and application. However, existing modeling approaches, which typically represent polymers by the constituent monomers, struggle to capture the whole properties of polymer, since the properties change during the polymerization process. In this study, we propose a Multimodal Infinite Polymer Sequence (MIPS) pre-training framework, which represents polymers as infinite sequences of monomers and integrates both topological and spatial information for comprehensive modeling. From the topological perspective, we generalize message passing mechanism (MPM) and graph attention mechanism (GAM) to infinite polymer sequences. For MPM, we demonstrate that applying MPM to infinite polymer sequences is equivalent to applying MPM on the induced star-linking graph of monomers. For GAM, we propose to further replace global graph attention with localized graph attention (LGA). Moreover, we show the robustness of the ''star linking'' strategy through an adversarial evaluation method named Repeat and Shift Invariance Test (RSIT). Despite its robustness, ''star linking'' strategy exhibits limitations when monomer side chains contain ring structures, a common characteristic of polymers, as it fails the Weisfeiler-Lehman (WL) test. To overcome this issue, we propose backbone embedding to enhance the capability of MPM and LGA on infinite polymer sequences. From the spatial perspective, we extract 3D descriptors of repeating monomers to capture spatial information. Finally, we design a cross-modal fusion mechanism to unify the topological and spatial information. Experimental validation across eight diverse polymer property prediction tasks reveals that MIPS achieves state-of-the-art performance. Ablation studies further comfirm the efficacy of our infinite polymer sequence modeling approach and multimodal pre-training framework.
Yaosen Min, Miao Li 0003, Ji Wu 0002
ACM Multimedia2
2023 Molecule Generation For Target Protein Binding with Structural Motifs
Zaixi Zhang, Yaosen Min, Shuxin Zheng, Qi Liu 0003
ICLR2
2021 MolCloze: A Unified Cloze-style Self-supervised Molecular Structure Learning Model for Chemical Property Prediction
abstract
Machine Learning approaches are required to predict accurately on test samples that are distributionally different from training ones in the fields of drug discovery, computational biology, and cheminformatics. However, (i) labeled task-specific molecule data are often scarce, and (ii) poor generalization due to test molecules that are structurally different from those seen during training. To alleviate the problems, we propose a cloze-style self-supervised learning model (MolCloze) to obtain universal informative representations for molecular property prediction tasks. With carefully designed self-supervised tasks unifying generative- and discriminative-paradigm, MolCloze can learn rich structural and semantic information of molecules from enormous unlabelled molecular data. To capture such complex information, we design two novel strategies - Structural Fingerprint Tokenization (SFT) for better tokenizing molecule graphs, and Normalized Graph Raw Shortcut-connection (NGRS) for better latent representations by training a deeper model. We pretrain the MolCloze model via three tasks, which are Unordered Masked Language Modeling (UMLM), Replaced Masked Token Detection (RMTD), and Contrastive Energy-based Unmasked Token Clozing (CE-UTC). Then, we transfer the pre-trained model to a broad range of downstream molecular property prediction tasks via minor architecture modification. Extensive experiments demonstrate the generalizability of MolCloze by predicting a broad range of chemical properties which are related to drug discovery. We also observe significant performance boost on different downstream molecular property prediction datasets, achieving higher performance than the state-of-the-art baseline approaches and previous pre-training techniques developed for molecule data.
Yingheng Wang, Yaosen Min, Ji Wu 0002
BIBM3
2021 Molecular Graph Contrastive Learning with Parameterized Explainable Augmentations
abstract
Learning generalizable, transferable, and robust representations for molecule data has always been a challenge. The recent success of contrastive learning (CL) for self-supervised graph representation learning provides a novel perspective to learn molecule representations. However, existing graph CL frameworks usually adopt stochastic augmentations or schemes according to pre-defined rules ont he input graph to obtain different graph views in various scales, which may destroy topological semantemes and domain prior in molecule data, leading to suboptimal performance. Therefore, a well-designed parameterized augmentation scheme that preserves chemically meaningful structural information and intrinsically essential attributes is crucial for molecular graph contrastive learning, helping to learn representations that are insensitive to perturbation on unimportant atoms and bonds. In this paper, we propose a novel method, Molecular Graph Contrastive Learning with Parameterized Explainable Augmentations, that adaptively incorporates chemically significative information from both topological and semantic aspects of molecular graphs. Specifically, we apply deep neural networks to parameterize the augmentation process for both the molecular graph topology and atom attributes, to highlight contributive molecular substructures and recognize underlying chemical semantemes. Comprehensive experiments demonstrate that our method consistently outperforms compared baselines, verifying the effectiveness of the proposed framework. Our self-supervised model only uses one percent of the parameters to achieve comparative results against the state-of-the-art baseline, which has hundreds of millions of parameters. We also provide detailed case studies to validate the explainability of augmented views.
Yingheng Wang, Yaosen Min, Erzhuo Shao, Ji Wu 0002
BIBM2
2021 Multi-view Graph Contrastive Representation Learning for Drug-Drug Interaction Prediction
abstract
Potential Drug-Drug Interactions (DDI) occur while treating complex or co-existing diseases with drug combinations, which may cause changes in drugs’ pharmacological activity. Therefore, DDI prediction has been an important task in the medical health machine learning community. Graph-based learning methods have recently aroused widespread interest and are proved to be a priority for this task. However, these methods are often limited to exploiting the inter-view drug molecular structure and ignoring the drug’s intra-view interaction relationship, vital to capturing the complex DDI patterns. This study presents a new method, multi-view graph contrastive representation learning for drug-drug interaction prediction, MIRACLE for brevity, to capture inter-view molecule structure and intra-view interactions between molecules simultaneously. MIRACLE treats a DDI network as a multi-view graph where each node in the interaction graph itself is a drug molecular graph instance. We use GCN to encode DDI relationships and a bond-aware attentive message propagating method to capture drug molecular structure information in the MIRACLE learning stage. Also, we propose a novel unsupervised contrastive learning component to balance and integrate the multi-view information. Comprehensive experiments on multiple real datasets show that MIRACLE outperforms the state-of-the-art DDI prediction models consistently.
Yingheng Wang, Yaosen Min, Ji Wu 0002
WWW2
2018 Learning Protein Structural Fingerprints under the Label-Free Supervision of Domain Knowledge
Yaosen Min, Chenyao Lou, Xuefeng Cui
BIBM1