These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


Pubmed for Handhelds

PUBMED FOR HANDHELDS

Search MEDLINE/PubMed

  • Title: MultiSimNeNc: A network representation learning-based module identification method by network embedding and clustering.
    Author: Wu H, Liang B, Chen Z, Zhang H.
    Journal: Comput Biol Med; 2023 Apr; 156():106703. PubMed ID: 36889026.
    Abstract:
    Accurate identification of gene modules based on biological networks is an effective approach to understanding gene patterns of cancer from a module-level perspective. However, most graph clustering algorithms just consider low-order topological connectivity, which limits their accuracy in gene module identification. In this study, we propose a novel network-based method, MultiSimNeNc, to identify modules in various types of networks by integrating network representation learning (NRL) and clustering algorithms. In this method, we first obtain the multi-order similarity of the network using graph convolution (GC). Then, we aggregate the multi-order similarity to characterize the network structure and use non-negative matrix factorization (NMF) to achieve low-dimensional node characterization. Finally, we predict the number of modules based on the bayesian information criterion (BIC) and use the gaussian mixture model (GMM) to identify modules. To testify to the efficacy of MultiSimeNc in module identification, we apply this method to two types of biological networks and six benchmark networks, where the biological networks are constructed based on the fusion of multi-omics data from glioblastoma (GBM). The analysis shows that MultiSimNeNc outperforms several state-of-the-art module identification algorithms in identification accuracy, which is an effective method for understanding biomolecular mechanisms of pathogenesis from a module-level perspective.
    [Abstract] [Full Text] [Related] [New Search]