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

Minghao Sun

dblp:172/9758 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
6since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Graph learning · 100%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 66% Data integration and cleaning · 34%
Network and information security
1 paper
Security and privacy of machine learning · 50% Privacy and data protection · 50%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › structural bioinformatics
protein structure
0.912025
ProteinConformers: Benchmark Dataset for Simulating Protein Conformational Landscape Diversity and Plausibility · NeurIPS 2025
Bioinformatics and computational biology
protein structure prediction
0.912025
ProteinConformers: Benchmark Dataset for Simulating Protein Conformational Landscape Diversity and Plausibility · NeurIPS 2025
Machine learning › Graph learning › graph neural network › attention-based graph neural network
graph attention network
0.812024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024
Machine learning › Graph learning
graph neural network
0.812024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024
Recommender systems › e-commerce recommendation
complementary recommendation
0.812024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024
Data integration and cleaning › crowdsourced data processing
crowdsourced data aggregation
0.512021
Data Poisoning Attacks and Defenses to Crowdsourcing Systems · WWW 2021
Privacy and data protection
crowdsourcing
0.512021
Data Poisoning Attacks and Defenses to Crowdsourcing Systems · WWW 2021
Security and privacy of machine learning
poisoning attack
0.512021
Data Poisoning Attacks and Defenses to Crowdsourcing Systems · WWW 2021
Recommender systems › e-commerce recommendation
substitute recommendation
0.212024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024

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

self-supervised data augmentation · 1.5graph attention · 1.5optimization · 1.0evaluation metrics · 0.9benchmark dataset construction · 0.9all-atom molecular dynamics simulation · 0.9
YearPublicationVenuePosition
2026 ICHSC-Diff: A dual-stream guided conditional diffusion model for early hematoma expansion prediction
abstract
Intracerebral hemorrhage (ICH) is a type of stroke that, although less common than ischemic stroke, has higher mortality and disability rates. Among its complications, hematoma expansion (HE) is a major determinant of poor outcomes. Accurate segmentation of ICH lesions and timely prediction of HE are crucial for effective intervention. Existing methods mainly rely on the clinical experience of neurosurgeons and typically treat these two tasks independently, fundamentally overlooking the powerful, synergistic information shared between a hematoma’s morphology and its propensity for expansion, leading to inaccurate HE prediction. Furthermore, conventional deep learning models often struggle to capture irregular hematoma boundaries and fail to reconcile the feature conflict between pixel-level segmentation and image-level prediction. To comprehensively address these limitations, we propose a dual-stream guided conditional diffusion framework called ICHSC-Diff. It facilitates a symbiotic interplay by leveraging the intrinsic generative capabilities of diffusion, coupling generative features with explicit radiological data to form a multi-modal representation for robust early HE prediction. In particular, we design a Task-aware Conditioning Module that utilizes a Style Preservation Refinement Module (SPRM) for adaptive preliminary denoising, dynamically adjusting the filters to match different hematomas. Thereafter, a Synergistic Representation Generator captures multi-scale local features by separating noise from the signal, preserving edge and texture details to guide the generation of accurate hematoma masks. Moreover, we develop a Multi-Scale Hybrid Fusion (MSHF) module that uses an attention-driven mechanism to reconstruct and fuse radiological features with generative features. This process reduces redundant information unrelated to hematoma characteristics, leading to robust early HE prediction. We further accelerate the inference process using the DPM-Solver strategy, enhancing the model’s efficiency. Extensive experiments on real-world intracerebral hemorrhage datasets demonstrate that our method excels in overall prediction performance, which in turn enhances ICH segmentation performance. The source codes of our framework are publicly available at https://github.com/tarkmfcv/ICHSC-Diff .
Zhuo Zhang 0020, Quanfeng Ma, Minghao Sun, Zhihuang Wu, Mingju Gong
Knowl. Based Syst.5
2025 SAM-Enhanced Automated Postoperative Swallowing Quantification via Cine-MRI
abstract
Cine-MRI establishes transformative potential in postoperative swallowing assessment of tongue cancer patients through highly resolved dynamic images. Yet current qualitative methods are based on isolated anatomical landmarks, demanding specialized neural architectures and labor-intensive manual annotations. To overcome these limitations, we propose a segmentation anything model (SAM) grounded quantitative framework that enables automated and precise swallowing function assessment. Firstly, we leverage the teacher-student paradigm by fine-tuning SAM to create an anatomical motion expert from its diverse visual priors. Secondly, several lightweight state-of-the-art student networks are optimized and pre-trained to adapt to the distilled knowledge from these priors. Experiments validate that this SAM-based teacher supervision exhibits wide compatibility across diverse architectures, with U-Net achieving the most substantial improvements$\boldsymbol{(} \mathbf{+ 6. 1 2 \%}$Dice,$\boldsymbol{+ 6. 6 6 \%}$clDice), while maintaining computational efficiency for plug-and-play integration. Moreover, its convenient deployment can make clinical assessment of such functions more straightforward and reliable.
Minghao Sun, Chenghui Jiang
BIBM2
2025 ProteinConformers: Benchmark Dataset for Simulating Protein Conformational Landscape Diversity and Plausibility
abstract
Understanding the conformational landscape of proteins is essential for elucidating protein function and facilitating drug design. However, existing protein conformation benchmarks fail to capture the full energy landscape, limiting their ability to evaluate the diversity and physical plausibility of AI-generated structures. We introduce ProteinConformers, a large-scale benchmark dataset comprising over 381,000 physically realistic conformations for 87 CASP targets. These were derived from more than 40,000 structural decoys via extensive all-atom molecular dynamics simulations totaling over 6 million CPU hours. Using this dataset, we propose novel metrics to evaluate conformational diversity and plausibility, and systematically benchmark six protein conformation generative models. Our results highlight that leveraging large-scale protein sequence data can enhance a model’s ability to explore conformational space, potentially reducing reliance on MD-derived data. Additionally, we find that PDB and MD datasets influence model performance differently, current models perform well on inter-atomic distance prediction but struggle with inter-residue orientation generation. Overall, our dataset, evaluation metrics, and benchmarking results provide the first comprehensive foundation for assessing generative models in protein conformational modeling. Dataset and instructions are available at https://huggingface.co/ datasets/Jim990908/ProteinConformers/tree/main. Codes are stored at https://github.com/auroua/ProteinConformers. An interactive website locates at https://zhanggroup.org/ProteinConformers.
Yihang Zhou, Minghao Sun, Jin Song
NeurIPS3
2024 Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations
abstract
In e-commerce recommender systems, providing product suggestions to customers that are often bought together, which is called “complementary recommendation,” not only improves customer experience but also boosts business impact. However, in practice, it is highly challenging to efficiently extract the complementary relations between the items due to noisy and low coverage of the co-purchased records in transaction datasets. To address these challenges, graph neural networks (GNN) have been increasingly adopted in complementary item recommendations thanks to their capabilities in integrating side-information and topological structures to extract these complex item relationships. However, most existing GNN-based methods fall short in learning better product complementary representation since they often utilize a simple one-to-one product-to-vector mapping strategy, which fails to describe the transitive logic of complementary items. To overcome this challenge, we propose a new GNN model called transitivity-encoded graph attention networks (TransGAT). To our knowledge, TransGAT is the first method that extends representation space by encoding the behavioral direction into embedding space in GNN and enabling mutual relationship extraction between complementary items. In order to better extract customer's intrinsic behavioral information, we further adopt the substitute information as the guidance by jointly learning complements and substitutes graphs and coupling them together. Moreover, several self-supervised data augmentation strategies are incorporated in our approach. Through evaluations on three real-world datasets, TransGAT consistently surpasses contemporary benchmarks, showcasing its prowess in complementary item recommendations.
Chenghuan Guo, Minghao Sun, Yan Gao 0029, Jia Liu 0002, Michinari Momma, Itetsu Taru
ICDM4
2024 A New Cine-MRI Segmentation Method of Tongue Dorsum for Postoperative Swallowing Function Analysis
Minghao Sun, Chenghui Jiang, Xiaodan Lv
MICCAI (3)1
2021 Data Poisoning Attacks and Defenses to Crowdsourcing Systems
abstract
A key challenge of big data analytics is how to collect a large volume of (labeled) data. Crowdsourcing aims to address this challenge via aggregating and estimating high-quality data (e.g., sentiment label for text) from pervasive clients/users. Existing studies on crowdsourcing focus on designing new methods to improve the aggregated data quality from unreliable/noisy clients. However, the security aspects of such crowdsourcing systems remain under-explored to date. We aim to bridge this gap in this work. Specifically, we show that crowdsourcing is vulnerable to data poisoning attacks, in which malicious clients provide carefully crafted data to corrupt the aggregated data. We formulate our proposed data poisoning attacks as an optimization problem that maximizes the error of the aggregated data. Our evaluation results on one synthetic and two real-world benchmark datasets demonstrate that the proposed attacks can substantially increase the estimation errors of the aggregated data. We also propose two defenses to reduce the impact of malicious clients. Our empirical results show that the proposed defenses can substantially reduce the estimation errors of the data poisoning attacks.
Minghong Fang, Minghao Sun, Qi Li 0012, Neil Zhenqiang Gong, Jin Tian 0001, Jia Liu 0002
WWW2
2015 Visual tracking with astructured local model
abstract
In this paper, we propose a novel visual tracking algorithm combining appearance feature and spatial information. These two aspects extract the constant elements of the target object. To represent information of an object, we utilize a block-local model and a structured visual histogram learned from an object's spatial information, which can adapt to changes in the appearance of the target and environment of the background. During tracking, the proposed algorithm introduces an occlusion model to prevent the environment change from affecting the target's posterior probability. Besides, the online updating is based on incremental algorithms for principal component analysis and the renewal of a spatial histogram queue. Experimental results show that our method outperforms relative trackers.
Minghao Sun, Dandan Du, Huchuan Lu, Lihe Zhang
ICIP1