Zhipeng Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhipeng Hu has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoyan Kui
Central South University
6 shared publications - Beiji Zou
Central South University
5 shared publications - Jingli Wu
Guangxi Normal University
5 shared publications - Qinsong Li
Central South University
5 shared publications - Shen Jiang
School of Computer Science and Technology, Shandong Technology and Business University, Yantai 264005, China
4 shared publications - Wei Peng
Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, Yunnan, China
4 shared publications
Latest Publications
- Open Access
- 19 October 2026
- Published by Elsevier in Information Fusion
- Vol. 139
From diffusion-based semantic reconstruction to identity discrimination: Hierarchical information fusion for occluded person re-identification
- 19 October 2026
- Published by Elsevier in Information Fusion
- Vol. 139
Open AccessFrom diffusion-based semantic reconstruction to identity discrimination: Hierarchical information fusion for occluded person re-identification
- 1 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
Reliability-guided dual-view learning with SAM distillation for semi-supervised medical image segmentation
- 1 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
Reliability-guided dual-view learning with SAM distillation for semi-supervised medical image segmentation
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 23 (5) , 1995-2005
Enhancing Cancer Driver Genes Prediction via Multi-view Hypergraph and Dynamic Reward-Penalty Model
Cancer driver genes can grant cancer cells the ability to proliferate continuously and resist apoptosis, thereby promoting tumor evolution toward malignancy. Identifying cancer driver genes not only helps to reveal the molecular pathological network of cancer, but also provides important targets for the development of precise targeted drugs. Although the existing methods can partially compensate for the limitations of single-omics data to a certain extent, they are still inadequate in mining deep relationships among diverse omics features and gene synergy, thus impacting the accuracy of driver gene identification. In this paper, a cancer driver gene identification method integrating the multi-view hypergraph with the dynamic reward-penalty model is proposed and termed MHDP. Firstly, the functional module and spatial co-localization hypergraphs are constructed independently in functional and spatial dimensions, respectively, to capture the synergistic information among genes, as well as the functional and spatial information of genes. Secondly, the Bhattacharyya distance is employed to evaluate gene expression differences between normal and tumor samples. Then, miRNA importance scores are calculated based on the number of miRNA connections for each gene within the mRNA-miRNA bipartite graph. Finally, through analysis of correlations among different features, we propose a Dynamic Reward-Penalty model that adaptively adjusts weights of omics features to achieve efficient multi-omics integration. Experimental evaluation using breast, lung adenocarcinoma, and prostate cancer datasets demonstrates that MHDP markedly outperforms 8 state-of-the-art methods, including HWC, DriverRWH, and WMDS.netP, exhibiting significant improvements in accuracy, functional consistency, and partial area under the ROC curve (PAUC). MHDP source code can be obtained from https://github.com/DriverGene/MHDP.git.
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 23 (5) , 1995-2005
Enhancing Cancer Driver Genes Prediction via Multi-view Hypergraph and Dynamic Reward-Penalty Model
Cancer driver genes can grant cancer cells the ability to proliferate continuously and resist apoptosis, thereby promoting tumor evolution toward malignancy. Identifying cancer driver genes not only helps to reveal the molecular pathological network of cancer, but also provides important targets for the development of precise targeted drugs. Although the existing methods can partially compensate for the limitations of single-omics data to a certain extent, they are still inadequate in mining deep relationships among diverse omics features and gene synergy, thus impacting the accuracy of driver gene identification. In this paper, a cancer driver gene identification method integrating the multi-view hypergraph with the dynamic reward-penalty model is proposed and termed MHDP. Firstly, the functional module and spatial co-localization hypergraphs are constructed independently in functional and spatial dimensions, respectively, to capture the synergistic information among genes, as well as the functional and spatial information of genes. Secondly, the Bhattacharyya distance is employed to evaluate gene expression differences between normal and tumor samples. Then, miRNA importance scores are calculated based on the number of miRNA connections for each gene within the mRNA-miRNA bipartite graph. Finally, through analysis of correlations among different features, we propose a Dynamic Reward-Penalty model that adaptively adjusts weights of omics features to achieve efficient multi-omics integration. Experimental evaluation using breast, lung adenocarcinoma, and prostate cancer datasets demonstrates that MHDP markedly outperforms 8 state-of-the-art methods, including HWC, DriverRWH, and WMDS.netP, exhibiting significant improvements in accuracy, functional consistency, and partial area under the ROC curve (PAUC). MHDP source code can be obtained from https://github.com/DriverGene/MHDP.git.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. PP (4) , 1-12
Essential Proteins Prediction Using Features Synergy Model and GO Pure Centrality
Essential proteins are a crucial component of living organisms, and their absence will lead to cell death or reproductive arrest. Discovering these proteins can propel advancements in synthetic biology and facilitate the development of novel antibiotics and therapies for various diseases. However, current computational methods suffer from two major drawbacks that hinder their discovery rate: one is the significant noise in protein-protein interaction (PPI) data, and the other is the inadequate consideration of feature relationships. To enhance identification capabilities, this study proposes a novel essential protein prediction method, Feature Synergy Method (FSM), which leverages a features synergy model and GO pure centrality. The FSM is described as folows:Firstly, based on the principle of co-expression, gene expression data are integrated with the original PPI network to construct a pure PPI network (PPIN). Subsequently, GO annotation data are employed to calculate GO_sim weights for the interactions within the original PPI network, forming a GS_PIN. The PPIN and GS_PIN are then fused to establish the GS_PPIN, which helps mitigate the impact of noise in PPI data. Secondly, a new centrality measure, GO pure centrality (GPC), is designed based on this GO similarity-weighted pure PPI network. Thirdly, an evolutionary conservation score (ECS) is extracted from subcellular localization and orthologous proteins data. Fourthly, after analyzing the relationship between GPC and ECS, a novel fusion model, the features synergy model, is developed to integrate GPC and ECS, ultimately leading to the proposal of the new essential protein prediction method, FSM. To validate the performance of FSM, six computational methods (PeC, WDC, ION, NCCO, E_POC, and JDC) and six centrality measures (NC, IC, EC, SC, CC, and DC) were evaluated on three distinct yeast datasets. The results demonstrate that FSM achieves a higher essential protein identification rate. Similarly, GPC identifies more essential proteins compared to the six centrality-based approaches (NC, IC, EC, SC, CC, and DC).
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. PP (4) , 1-12
Essential Proteins Prediction Using Features Synergy Model and GO Pure Centrality
Essential proteins are a crucial component of living organisms, and their absence will lead to cell death or reproductive arrest. Discovering these proteins can propel advancements in synthetic biology and facilitate the development of novel antibiotics and therapies for various diseases. However, current computational methods suffer from two major drawbacks that hinder their discovery rate: one is the significant noise in protein-protein interaction (PPI) data, and the other is the inadequate consideration of feature relationships. To enhance identification capabilities, this study proposes a novel essential protein prediction method, Feature Synergy Method (FSM), which leverages a features synergy model and GO pure centrality. The FSM is described as folows:Firstly, based on the principle of co-expression, gene expression data are integrated with the original PPI network to construct a pure PPI network (PPIN). Subsequently, GO annotation data are employed to calculate GO_sim weights for the interactions within the original PPI network, forming a GS_PIN. The PPIN and GS_PIN are then fused to establish the GS_PPIN, which helps mitigate the impact of noise in PPI data. Secondly, a new centrality measure, GO pure centrality (GPC), is designed based on this GO similarity-weighted pure PPI network. Thirdly, an evolutionary conservation score (ECS) is extracted from subcellular localization and orthologous proteins data. Fourthly, after analyzing the relationship between GPC and ECS, a novel fusion model, the features synergy model, is developed to integrate GPC and ECS, ultimately leading to the proposal of the new essential protein prediction method, FSM. To validate the performance of FSM, six computational methods (PeC, WDC, ION, NCCO, E_POC, and JDC) and six centrality measures (NC, IC, EC, SC, CC, and DC) were evaluated on three distinct yeast datasets. The results demonstrate that FSM achieves a higher essential protein identification rate. Similarly, GPC identifies more essential proteins compared to the six centrality-based approaches (NC, IC, EC, SC, CC, and DC).
- Top Cited Papers
- 26 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
HG-Mamba:Multi-view dynamic hypergraph modeling with state space model for medical image segmentation
- 26 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
Top Cited PapersHG-Mamba:Multi-view dynamic hypergraph modeling with state space model for medical image segmentation
- 12 March 2026
- Published by Elsevier in Neurocomputing
- Vol. 680
DCFANet: Merging dynamic context clustering mamba and context-to-focus attention for medical image segmentation
- 12 March 2026
- Published by Elsevier in Neurocomputing
- Vol. 680
DCFANet: Merging dynamic context clustering mamba and context-to-focus attention for medical image segmentation
- Top Cited Papers
- 15 January 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 336
RMViM-Net: Residual multi-path vision mamba with graph interaction attention for medical image segmentation
- 15 January 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 336
Top Cited PapersRMViM-Net: Residual multi-path vision mamba with graph interaction attention for medical image segmentation
- 8 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (6) , 3305-3316
Predicting Driver Genes From Multi-Omics Data Using Hierarchical Multi-Feature Synergy Model
Cancer is an extremely complex disease, whose occurrence and development are influenced by a multitude of factors, among which the abnormal activity of cancer driver genes plays a crucial role in the pathological process. Identifying these genes allows researchers to understand pathogenic mechanisms and biological functions of cancer, facilitating the development of targeted therapies. Current methods for identifying driver genes often ignore the synergism among genes and the importance of features, thereby affecting identification accuracy. In this paper, we propose a cancer driver genes identification method called HMFS, which is based on the hierarchical multi-feature synergy model. Firstly, a hypergraph is constructed using Node2vec and K-means algorithm. By analyzing the topological feature and mutual exclusion degree of genes in each hyperedge, the Mutation Aggregation Coefficient is extracted. Then, based on the functional expression mechanism of genes, differential expression analysis is performed using miRNA and mRNA expression data. Finally, by analyzing the importance among features, the Hierarchical Multi-Feature Synergy is proposed for features fusion. In this paper, experiments are conducted on three real cancer datasets. Compared with seven representative methods, HMFS has the best performance on all evaluation indicators. HMFS source code can be obtained from https://github.com/DriverGene/HMFS.git.
- 8 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (6) , 3305-3316
Predicting Driver Genes From Multi-Omics Data Using Hierarchical Multi-Feature Synergy Model
Cancer is an extremely complex disease, whose occurrence and development are influenced by a multitude of factors, among which the abnormal activity of cancer driver genes plays a crucial role in the pathological process. Identifying these genes allows researchers to understand pathogenic mechanisms and biological functions of cancer, facilitating the development of targeted therapies. Current methods for identifying driver genes often ignore the synergism among genes and the importance of features, thereby affecting identification accuracy. In this paper, we propose a cancer driver genes identification method called HMFS, which is based on the hierarchical multi-feature synergy model. Firstly, a hypergraph is constructed using Node2vec and K-means algorithm. By analyzing the topological feature and mutual exclusion degree of genes in each hyperedge, the Mutation Aggregation Coefficient is extracted. Then, based on the functional expression mechanism of genes, differential expression analysis is performed using miRNA and mRNA expression data. Finally, by analyzing the importance among features, the Hierarchical Multi-Feature Synergy is proposed for features fusion. In this paper, experiments are conducted on three real cancer datasets. Compared with seven representative methods, HMFS has the best performance on all evaluation indicators. HMFS source code can be obtained from https://github.com/DriverGene/HMFS.git.
- Open Access
- 27 March 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (4)
MNMO: discover driver genes from a multi-omics data based-multi-layer network
Motivation: Cancer as a public health problem is driven by genomic variations in “cancer driver” genes. The identification of driver genes is critical for the discovery of key biomarkers and the development of personalized therapy. Results: We propose a prediction method MNMO: a multi-layer network model based on multi-omics data. MNMO firstly constructs a dynamically adjusted four-layer network composed of miRNAs and three kinds of genes with different features. Then three kinds of scores, i.e. control capacity, mutation score, and network score, are devised and calculated by harmonic mean to produce the integrated gene score. Experiments were performed on three kinds of real cancer data to compare the identification performance of method MNMO with that of six state-of-the-art ones. The results indicate that method MNMO presents the best identification performance under most circumstances. The genes prioritized by method MNMO not only have a better match to the benchmark ones than those identified by the other methods, but also are all associated with the development and progression of cancers. In addition, some extended versions of method MNMO can further achieve better performance on most evaluation metrics for some specific datasets. They may be more conducive to identifying tissue-specific genes, which has been verified through a number of experiments. Availability and implementation: The source code and the R package “MNMO” are available at https://github.com/Zheng-D/MNMO. The dataset and code are archived at https://doi.org/10.5281/zenodo.14969986.
- 27 March 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (4)
Open AccessMNMO: discover driver genes from a multi-omics data based-multi-layer network
Motivation: Cancer as a public health problem is driven by genomic variations in “cancer driver” genes. The identification of driver genes is critical for the discovery of key biomarkers and the development of personalized therapy. Results: We propose a prediction method MNMO: a multi-layer network model based on multi-omics data. MNMO firstly constructs a dynamically adjusted four-layer network composed of miRNAs and three kinds of genes with different features. Then three kinds of scores, i.e. control capacity, mutation score, and network score, are devised and calculated by harmonic mean to produce the integrated gene score. Experiments were performed on three kinds of real cancer data to compare the identification performance of method MNMO with that of six state-of-the-art ones. The results indicate that method MNMO presents the best identification performance under most circumstances. The genes prioritized by method MNMO not only have a better match to the benchmark ones than those identified by the other methods, but also are all associated with the development and progression of cancers. In addition, some extended versions of method MNMO can further achieve better performance on most evaluation metrics for some specific datasets. They may be more conducive to identifying tissue-specific genes, which has been verified through a number of experiments. Availability and implementation: The source code and the R package “MNMO” are available at https://github.com/Zheng-D/MNMO. The dataset and code are archived at https://doi.org/10.5281/zenodo.14969986.
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (1) , 322-332
Using Multi-Feature Weak Consensus Model to Discover Essential Proteins
Essential proteins play an essential role in cell survival and replication. Currently, more and more computational methods are developed to identify essential proteins, which overcome the time-consuming, costly and inefficient shortcomings with biological experimental methods.In order to improve the recognition rate, some new methods by fusing multiple features are developed, but they seldom consider the connection among features. After analyzing a large number of methods based on multi-feature fusion, a phenomenon among features is found, called weak consensus,then a weak consensus model to fuse these features is proposed in this paper.After analyzing the relationship between a protein and its neighbors in protein-protein interaction networks, a new centrality, namely neighborhood aggregation centrality(NAC) is developed in this paper.Then, a Max-Min strategy is used to integrate NAC with Pearson correlation coefficient and Jaccard similarity coefficient based on gene expression data to obtain local importance score. In addition, orthologous feature score is used to measure proteins conservation.Finally,by using the weak consensus model to fuse orthologous feature score with local importance score, a new method WOL is proposed in this paper.Then experiments are performed on S.cerevisiae data. The results show that compared with WDC, PeC, ION, JDC, NCCO and E_POC, WOL has a higher recognition rate.
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (1) , 322-332
Using Multi-Feature Weak Consensus Model to Discover Essential Proteins
Essential proteins play an essential role in cell survival and replication. Currently, more and more computational methods are developed to identify essential proteins, which overcome the time-consuming, costly and inefficient shortcomings with biological experimental methods.In order to improve the recognition rate, some new methods by fusing multiple features are developed, but they seldom consider the connection among features. After analyzing a large number of methods based on multi-feature fusion, a phenomenon among features is found, called weak consensus,then a weak consensus model to fuse these features is proposed in this paper.After analyzing the relationship between a protein and its neighbors in protein-protein interaction networks, a new centrality, namely neighborhood aggregation centrality(NAC) is developed in this paper.Then, a Max-Min strategy is used to integrate NAC with Pearson correlation coefficient and Jaccard similarity coefficient based on gene expression data to obtain local importance score. In addition, orthologous feature score is used to measure proteins conservation.Finally,by using the weak consensus model to fuse orthologous feature score with local importance score, a new method WOL is proposed in this paper.Then experiments are performed on S.cerevisiae data. The results show that compared with WDC, PeC, ION, JDC, NCCO and E_POC, WOL has a higher recognition rate.