Dataset Information

Molecular subtyping of Alzheimer's disease with consensus non-negative matrix factorization.

ABSTRACT: Alzheimer's disease (AD) is a heterogeneous disease and exhibits diverse clinical presentations and disease progression. Some pathological and anatomical subtypes have been proposed. However, these subtypes provide a limited mechanistic understanding for AD. Leveraging gene expression data of 222 AD patients from The Religious Orders Study and Memory and Aging Project (ROSMAP) Study, we identified two AD molecular subtypes (synaptic type and inflammatory type) using consensus non-negative matrix factorization (NMF). Synaptic type is characterized by disrupted synaptic vesicle priming and recycling and synaptic plasticity. Inflammatory type is characterized by disrupted IL2, interferon alpha and gamma pathways. The two AD molecular subtypes were validated using independent data from Gene Expression Omnibus. We further demonstrated that the two molecular subtypes are associated with APOE genotypes, with synaptic type more prevalent in AD patients with E3E4 genotype and inflammatory type more prevalent in AD patients with E3E3 genotype (p = 0.031). In addition, two molecular subtypes are differentially represented in male and female AD, with synaptic type more prevalent in male and inflammatory type in female patients (p = 0.051). Identification of AD molecular subtypes has potential in facilitating disease mechanism understanding, clinical trial design, drug discovery, and precision medicine for AD.

SUBMITTER: Zheng C

PROVIDER: S-EPMC8136734 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:Background:Matrix factorization is a well established pattern discovery tool that has seen numerous applications in biomedical data analytics, such as gene expression co-clustering, patient stratification, and gene-disease association mining. Matrix factorization learns a latent data model that takes a data matrix and transforms it into a latent feature space enabling generalization, noise removal and feature discovery. However, factorization algorithms are numerically intensive, and hence there is a pressing challenge to scale current algorithms to work with large datasets. Our focus in this paper is matrix tri-factorization, a popular method that is not limited by the assumption of standard matrix factorization about data residing in one latent space. Matrix tri-factorization solves this by inferring a separate latent space for each dimension in a data matrix, and a latent mapping of interactions between the inferred spaces, making the approach particularly suitable for biomedical data mining. Results:We developed a block-wise approach for latent factor learning in matrix tri-factorization. The approach partitions a data matrix into disjoint submatrices that are treated independently and fed into a parallel factorization system. An appealing property of the proposed approach is its mathematical equivalence with serial matrix tri-factorization. In a study on large biomedical datasets we show that our approach scales well on multi-processor and multi-GPU architectures. On a four-GPU system we demonstrate that our approach can be more than 100-times faster than its single-processor counterpart. Conclusions:A general approach for scaling non-negative matrix tri-factorization is proposed. The approach is especially useful parallel matrix factorization implemented in a multi-GPU environment. We expect the new approach will be useful in emerging procedures for latent factor analysis, notably for data integration, where many large data matrices need to be collectively factorized.

Project description:MotivationUnderstanding the underlying mutational processes of cancer patients has been a long-standing goal in the community and promises to provide new insights that could improve cancer diagnoses and treatments. Mutational signatures are summaries of the mutational processes, and improving the derivation of mutational signatures can yield new discoveries previously obscured by technical and biological confounders. Results from existing mutational signature extraction methods depend on the size of available patient cohort and solely focus on the analysis of mutation count data without considering the exploitation of metadata.ResultsHere we present a supervised method that utilizes cancer type as metadata to extract more distinctive signatures. More specifically, we use a negative binomial non-negative matrix factorization and add a support vector machine loss. We show that mutational signatures extracted by our proposed method have a lower reconstruction error and are designed to be more predictive of cancer type than those generated by unsupervised methods. This design reduces the need for elaborate post-processing strategies in order to recover most of the known signatures unlike the existing unsupervised signature extraction methods. Signatures extracted by a supervised model used in conjunction with cancer-type labels are also more robust, especially when using small and potentially cancer-type limited patient cohorts. Finally, we adapted our model such that molecular features can be utilized to derive an according mutational signature. We used APOBEC expression and MUTYH mutation status to demonstrate the possibilities that arise from this ability. We conclude that our method, which exploits available metadata, improves the quality of mutational signatures as well as helps derive more interpretable representations.Availability and implementationhttps://github.com/ratschlab/SNBNMF-mutsig-public.Supplementary informationSupplementary data are available at Bioinformatics online.

Dataset Information

Molecular subtyping of Alzheimer's disease with consensus non-negative matrix factorization.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets