Deciphering Cell Type Abundance in Proteomics Data Through Graph Neural Networks

Recent advancements in proteomics sequencing have significantly enhanced our ability to explore cell-type-specific signatures within complex tissues, providing critical insights into disease mechanisms. However, current proteomic technologies often suffer from low resolution, resulting in the mixing of multiple cell types during profiling. To address this limitation, cell-type deconvolution methods are developed to infer cellular composition from proteomic data. While most existing deconvolution methods are focused on transcriptomics, their application to proteomics is hindered by the weak correlation and divergent quantification between transcriptome and proteome data. Although a few proteomic-specific deconvolution methods are recently emerged, they still exhibit limited capability and performance, partly because they only extract shared information from individual samples while ignoring higher-order relationships between them. Here, GraphDEC is proposed, a novel graph neural network-based method for deciphering cell type proportions in proteomic profiling data. GraphDEC begins by simulating bulk samples from single-cell proteomic data to create reference data, which is then used to infer cell types in target datasets. Specifically, GraphDEC employs an autoencoder to extract low-dimensional representations from both reference and target proteomic data, enabling the construction of similarity relationships among samples. These relationships, combined with proteomic data, are processed by a graph neural network that integrates a multi-channel mechanism and a hybrid neighborhood-aware approach to learn highly effective representations. To optimize the model, GraphDEC utilizes multiple loss functions, including triplet loss, domain adaptation loss, and Mean Squared Error (MSE) loss, ensuring robust performance and mitigating batch effects. Benchmark experiments demonstrate that GraphDEC achieves state-of-the-art performance across diverse synthetic proteomic datasets from different sequencing technologies and real-world spatial proteomic datasets. Furthermore, GraphDEC exhibits strong generalization capabilities, showing high efficiency when applied to cross-species proteomic data and even transcriptomics.

Authors

Institutions

Publication Details

Journal
Advanced Science
Published
2025-06-20
DOI
https://doi.org/10.1002/advs.202502987
Citations
1
Primary Topic
Single-cell and spatial transcriptomics
Type
article
Field-Weighted Citation Impact
0.81

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deciphering Cell Type Abundance in Proteomics Data Through Graph Neural Networks

Yuedong Yang, Zheng Wang, Hongyu Zhang, Yuansong Zeng et al.
1 citations
Advanced Science
Single-cell and spatial transcriptomics
0.81
article

Deciphering Cell Type Abundance in Proteomics Data Through Graph Neural Networks

Yuedong Yang, Zheng Wang, Hongyu Zhang, Yuansong Zeng, Zhiming Dai, Huiying Zhao, T. Y. Qi, Yujie Song
article en
1 citations

Abstract

Recent advancements in proteomics sequencing have significantly enhanced our ability to explore cell-type-specific signatures within complex tissues, providing critical insights into disease mechanisms. However, current proteomic technologies often suffer from low resolution, resulting in the mixing of multiple cell types during profiling. To address this limitation, cell-type deconvolution methods are developed to infer cellular composition from proteomic data. While most existing deconvolution methods are focused on transcriptomics, their application to proteomics is hindered by the weak correlation and divergent quantification between transcriptome and proteome data. Although a few proteomic-specific deconvolution methods are recently emerged, they still exhibit limited capability and performance, partly because they only extract shared information from individual samples while ignoring higher-order relationships between them. Here, GraphDEC is proposed, a novel graph neural network-based method for deciphering cell type proportions in proteomic profiling data. GraphDEC begins by simulating bulk samples from single-cell proteomic data to create reference data, which is then used to infer cell types in target datasets. Specifically, GraphDEC employs an autoencoder to extract low-dimensional representations from both reference and target proteomic data, enabling the construction of similarity relationships among samples. These relationships, combined with proteomic data, are processed by a graph neural network that integrates a multi-channel mechanism and a hybrid neighborhood-aware approach to learn highly effective representations. To optimize the model, GraphDEC utilizes multiple loss functions, including triplet loss, domain adaptation loss, and Mean Squared Error (MSE) loss, ensuring robust performance and mitigating batch effects. Benchmark experiments demonstrate that GraphDEC achieves state-of-the-art performance across diverse synthetic proteomic datasets from different sequencing technologies and real-world spatial proteomic datasets. Furthermore, GraphDEC exhibits strong generalization capabilities, showing high efficiency when applied to cross-species proteomic data and even transcriptomics.

Advanced ScienceVol. 12(33)
Sun Yat-sen University (CN), Chongqing University (CN), Sun Yat-sen Memorial Hospital (CN)
National Natural Science Foundation of China, Sun Yat-sen University, China Postdoctoral Science Foundation, Natural Science Foundation of Guangdong Province, Centre Scientifique et Technique du Bâtiment, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 27%
Single-cell and spatial transcriptomics
0.81
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.