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.

Yixuan Ye

dblp:301/9876 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
8since 2021 · last 2026
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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 · 75% Representation and self-supervised learning · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph clustering
contrastive graph clustering
1.012026
Trustworthy Neighborhoods Mining: Homophily-Aware Neutral Contrastive Learning for Graph Clustering · IEEE Trans. Knowl. Data Eng. 2026
Machine learning › Representation and self-supervised learning
contrastive learning
1.012026
Refinement Contrastive Learning of Cell-Gene Associations for Unsupervised Cell Type Identification · AAAI 2026
Machine learning › Graph learning
graph clustering
1.012026
Trustworthy Neighborhoods Mining: Homophily-Aware Neutral Contrastive Learning for Graph Clustering · IEEE Trans. Knowl. Data Eng. 2026
Machine learning › Graph learning
graph neural network
1.012026
Trustworthy Neighborhoods Mining: Homophily-Aware Neutral Contrastive Learning for Graph Clustering · IEEE Trans. Knowl. Data Eng. 2026
Bioinformatics and computational biology › single-cell analysis
cell type annotation
1.012026
Refinement Contrastive Learning of Cell-Gene Associations for Unsupervised Cell Type Identification · AAAI 2026
Bioinformatics and computational biology
single-cell analysis
1.012026
Refinement Contrastive Learning of Cell-Gene Associations for Unsupervised Cell Type Identification · AAAI 2026

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

contrastive learning · 3.0representation learning · 2.0clustering · 2.0neighborhood mining · 1.0
YearPublicationVenuePosition
2026 Refinement Contrastive Learning of Cell-Gene Associations for Unsupervised Cell Type Identification
abstract
Unsupervised cell type identification is crucial for uncovering and characterizing heterogeneous populations in single cell omics studies. Although a range of clustering methods have been developed, most focus exclusively on intrinsic cellular structure and ignore the pivotal role of cell-gene associations, which limits their ability to distinguish closely related cell types. To this end, we propose a Refinement Contrastive Learning framework (scRCL) that explicitly incorporates cell-gene interactions to derive more informative representations. Specifically, we introduce two contrastive distribution alignment components that reveal reliable intrinsic cellular structures by effectively exploiting cell-cell structural relationships. Additionally, we develop a refinement module that integrates gene-correlation structure learning to enhance cell embeddings by capturing underlying cell-gene associations. This module strengthens connections between cells and their associated genes, refining the representation learning to exploiting biologically meaningful relationships. Extensive experiments on several single-cell RNA-seq and spatial transcriptomics benchmark datasets demonstrate that our method consistently outperforms state-of-the-art baselines in cell-type identification accuracy. Moreover, downstream biological analyses confirm that the recovered cell populations exhibit coherent gene-expression signatures, further validating the biological relevance of our approach.
Yixuan Ye, Cheng Liu 0001, Si Wu 0002, Hau-San Wong
AAAI3
2026 Self-supervised semantic graph propagation for multi-view clustering
Jiongzhi Qiu, Yixuan Ye, Jiajun Xian, Man-Fai Leung, Hangjun Che, Cheng Liu 0001
Neural Networks2
2026 SEAL: Semantic-Aware Contrastive Learning for scRNA-Seq Clustering
abstract
The development of single-cell RNA sequencing (scRNA-seq) technology has enabled the exploration of biological processes at the cellular level. A critical task in scRNA-seq data analysis is the unsupervised clustering of cells to distinguish different cell types. While various clustering methods have been successfully developed for scRNA-seq data, they still face limitations, particularly in terms of unstable clustering performance. This is often due to their inability to fully capture the intrinsic properties of cells, especially in the presence of high dropout rates and noise in the data. In this work, we propose a SEmantic-Aware contrastive Learning (SEAL) approach for scRNA-seq clustering. Specifically, we randomly mask the gene expression of each cell to generate two different augmentations of the cell data, and then apply semantic-aware contrastive learning to capture semantically invariant representations across these augmentations by leveraging semantic information from generated pseudo-labels. Experimental results demonstrate that our method effectively learns biologically meaningful representations and accurately identifies cell types.
Yixuan Ye, Jiawen Sun, Jiajun Xian, Cheng Liu 0001
IEEE Trans. Comput. Biol. Bioinform.1
2026 SMART: Semantic Matching Contrastive Learning for Partially View-Aligned Clustering
abstract
Multi-view clustering has been empirically shown to improve learning performance by leveraging the inherent complementary information across multiple views of data. However, in real-world scenarios, collecting strictly aligned views is challenging, and learning from both aligned and unaligned data becomes a more practical solution. Partially View-aligned Clustering (PVC) aims to learn correspondences between misaligned view samples to better exploit the potential consistency and complementarity across views, including both aligned and unaligned data. However, most existing PVC methods fail to leverage unaligned data to capture the shared semantics among samples from the same cluster. Moreover, the inherent heterogeneity of multi-view data induces distributional shifts in representations, leading to inaccuracies in establishing meaningful correspondences between cross-view latent features and, consequently, impairing learning effectiveness. To address these challenges, we propose a Semantic MAtching contRasTive learning model (SMART) for PVC. The main idea of our approach is to alleviate the influence of cross-view distributional shifts, thereby facilitating semantic matching contrastive learning to fully exploit semantic relationships in both aligned and unaligned data. Specifically, we mitigate view distribution shifts by aligning cross-view covariance matrices, which enables the inference of a semantic graph for all data. Guided by the learned semantic graph, we further exploit semantic consistency across views through semantic matching contrastive learning. After the optimization of the above mechanisms, our model smoothly performs semantic matching for different view embeddings instead of the cumbersome view realignment, which enables the learned representations to enjoy richer category-level semantics and stronger robustness. Extensive experiments on eight benchmark datasets demonstrate that our method consistently outperforms existing approaches on the PVC problem. The code is available at https://github.com/THPengL/SMART.
Yixuan Ye, Cheng Liu 0001, Hangjun Che, Fei Wang 0056, Zhiwen Yu 0002, Si Wu 0002, Hau-San Wong
IEEE Trans. Circuits Syst. Video Technol.2
2026 Trustworthy Neighborhoods Mining: Homophily-Aware Neutral Contrastive Learning for Graph Clustering
Yixuan Ye, Cheng Liu 0001, Hangjun Che, Man-Fai Leung, Si Wu 0002, Hau-San Wong
IEEE Trans. Knowl. Data Eng.2
2025 Cross-View Neighborhood Contrastive Multi-View Clustering with View Mixup Feature Learning
abstract
Multi-view clustering (MVC) has shown that leveraging both consistency and complementary information across views enhances clustering performance. However, most existing methods focus on aligning features into the same dimension, often neglecting cross-view heterogeneity and introducing discrepancies. To address this, we propose a novel multi-view clustering framework that combines cross-view neighborhood contrastive learning with a cross-attention view-mixup feature learning mechanism. Specifically, the cross-attention view-mixup module learns view-invariant feature representations by capturing complementary and consistent information, while the neighborhood contrastive learning module uncovers semantic structures across views based on the learned mixup features. By implicitly performing feature mixup across views and effectively integrating cross-view neighborhood contrastive learning, our method alleviates cross-view discrepancies and enables more effective integration of complementary and consistent information, ultimately enhancing clustering performance. Experiments conducted on several real datasets demonstrate the effectiveness of our proposed method in comparision with several representative MVC approaches.
Yixuan Ye, Yang Zhang 0073, Rui Li 0045, Cheng Liu 0001, Si Wu 0002, Hau-San Wong
ICME1
2025 Robust pleiotropy-decomposed polygenic scores identify distinct contributions to elevated coronary artery disease polygenic risk
abstract
BACKGROUND: Polygenic risk score (PRS) have proved to offer robust risk prediction for coronary artery disease (CAD). However, the global CAD PRS summarizes the joint effects of all the markers in the genome, masking potential genetic heterogeneity that may be important for disease interpretation and targeted interventions. METHODS: Using summary-level data, we identified 43 significant CAD-related traits based on genetic correlations, and further classified them into eight pleiotropy clusters based on their biological functions. We then partitioned the genome into 2,353 near-independent regions. Variants in each region were assigned to the trait most genetically similar to CAD, and then were labeled with the corresponding pleiotropy cluster. We grouped variants without labels into a ninth, non-specific cluster. The Pleiotropy Decomposed (PD) PRSs for each of the nine clusters were calculated using variants assigned to each cluster for 407,903 samples of European ancestry from the UK Biobank (UKBB). RESULTS: We decomposed the CAD PRS into nine PD-PRSs and further stratified individuals with high CAD-PRS into nine subgroups. Each PD-PRS accounted for a higher proportion of the global CAD-PRS within its corresponding subgroup than in the remaining subjects with high CAD-PRS (e.g., 25.2% (0.07) vs. 10.06% (0.07) for lipids-PD-PRS). Additionally, these subgroups showed distinct clinical features. For example, in the lipids-related subgroup, lipoprotein(a) and LDL-cholesterol levels were 67.5% and 18.3% higher, respectively, compared to the remaining high-risk individuals. Furthermore, significant interactions were observed between blood pressure and BP PD-PRS, and between current smoking and respiratory system PD-PRS. CONCLUSION: Our findings suggest that PD-PRSs may reveal substantial genetic and phenotypic heterogeneity among individuals with high CAD-PRS. The unique PD-PRS compositions of each individual can highlight the relative importance of different pleiotropic regions.
Jiaqi Hu 0004, Yixuan Ye, Yunfeng Ruan, Pradeep Natarajan, Hongyu Zhao 0003
PLoS Comput. Biol.2
2021 Comparison of methods for estimating genetic correlation between complex traits using GWAS summary statistics
abstract
Genetic correlation is the correlation of phenotypic effects by genetic variants across the genome on two phenotypes. It is an informative metric to quantify the overall genetic similarity between complex traits, which provides insights into their polygenic genetic architecture. Several methods have been proposed to estimate genetic correlation based on data collected from genome-wide association studies (GWAS). Due to the easy access of GWAS summary statistics and computational efficiency, methods only requiring GWAS summary statistics as input have become more popular than methods utilizing individual-level genotype data. Here, we present a benchmark study for different summary-statistics-based genetic correlation estimation methods through simulation and real data applications. We focus on two major technical challenges in estimating genetic correlation: marker dependency caused by linkage disequilibrium (LD) and sample overlap between different studies. To assess the performance of different methods in the presence of these two challenges, we first conducted comprehensive simulations with diverse LD patterns and sample overlaps. Then we applied these methods to real GWAS summary statistics for a wide spectrum of complex traits. Based on these experiments, we conclude that methods relying on accurate LD estimation are less robust in real data applications due to the imprecision of LD obtained from reference panels. Our findings offer guidance on how to choose appropriate methods for genetic correlation estimation in post-GWAS analysis.
Yiliang Zhang, Youshu Cheng, Wei Jiang 0019, Yixuan Ye, Qiongshi Lu, Hongyu Zhao 0003
Briefings Bioinform.4