Dataset Information

Non-negative Matrix Factorization Reveals Resting-State Cortical Alpha Network Abnormalities in the First-Episode Schizophrenia Spectrum.

ABSTRACT:

Background

Little is known about neural oscillatory dynamics in first-episode psychosis. Pathophysiology of functional connectivity can be measured through network activity of alpha oscillations, reflecting long-range communication between distal brain regions.

Methods

Resting magnetoencephalographic activity was collected from 31 individuals with first-episode schizophrenia spectrum psychosis and 22 healthy control individuals. Activity was projected to the realistic cortical surface, based on structural magnetic resonance imaging. The first principal component of activity in 40 Brodmann areas per hemisphere was Hilbert transformed within the alpha range. Non-negative matrix factorization was applied to single-trial alpha phase-locking values from all subjects to determine alpha networks. Within networks, energy and entropy were compared.

Results

Four cortical alpha networks were pathological in individuals with first-episode schizophrenia spectrum psychosis. The networks involved the bilateral anterior and posterior cingulate; left auditory, medial temporal, and cingulate cortex; right inferior frontal gyrus and widespread areas; and right posterior parietal cortex and widespread areas. Energy and entropy were associated with the Positive and Negative Syndrome Scale total and thought disorder factors for the first three networks. In addition, the left posterior temporal network was associated with positive and negative factors, and the right inferior frontal network was associated with the positive factor.

Conclusions

Machine learning network analysis of resting alpha-band neural activity identified several aberrant networks in individuals with first-episode schizophrenia spectrum psychosis, including the left temporal, right inferior frontal, right posterior parietal, and bilateral cingulate cortices. Abnormal long-range alpha communication is evident at the first presentation for psychosis and may provide clues about mechanisms of dysconnectivity in psychosis and novel targets for noninvasive brain stimulation.

SUBMITTER: Phalen H

PROVIDER: S-EPMC6943199 | 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.