Multiple-view clustering for identifying subject clusters and brain sub-networks using functional connectivity matrices without vectorization

• URL: http://arxiv.org/abs/2010.09941v2
• Date: Thu, 11 Feb 2021 11:14:53 GMT
• Title: Multiple-view clustering for identifying subject clusters and brain sub-networks using functional connectivity matrices without vectorization
• Authors: Tomoki Tokuda, Okito Yamashita, Junichiro Yoshimoto
• Abstract summary: We propose a novel multiple-view clustering method based on Wishart mixture models. The uniqueness of this method is that the multiple-view clustering of subjects is based on particular networks of nodes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In neuroscience, the functional magnetic resonance imaging (fMRI) is a vital tool to non-invasively access brain activity. Using fMRI, the functional connectivity (FC) between brain regions can be inferred, which has contributed to a number of findings of the fundamental properties of the brain. As an important clinical application of FC, clustering of subjects based on FC recently draws much attention, which can potentially reveal important heterogeneity in subjects such as subtypes of psychiatric disorders. In particular, a multiple-view clustering method is a powerful analytical tool, which identifies clustering patterns of subjects depending on their FC in specific brain areas. However, when one applies an existing multiple-view clustering method to fMRI data, there is a need to simplify the data structure, independently dealing with elements in a FC matrix, i.e., vectorizing a correlation matrix. Such a simplification may distort the clustering results. To overcome this problem, we propose a novel multiple-view clustering method based on Wishart mixture models, which preserves the correlation matrix structure without vectorization. The uniqueness of this method is that the multiple-view clustering of subjects is based on particular networks of nodes (or regions of interest, ROIs), optimized in a data-driven manner. Hence, it can identify multiple underlying pairs of associations between a subject cluster solution and a ROI sub-network. The key assumption of the method is independence among sub-networks, which is effectively addressed by whitening correlation matrices. We applied the proposed method to synthetic and fMRI data, demonstrating the usefulness and power of the proposed method.

Related papers

• Interpretable Multi-View Clustering Based on Anchor Graph Tensor Factorization [78.22249047957939]
  Multi-view clustering methods based on anchor graph factorization lack adequate cluster interpretability for the decomposed matrix. We address this limitation by using non-negative tensor factorization to decompose an anchor graph tensor that combines anchor graphs from multiple views.
  arXiv  Detail & Related papers  (2024-04-01T03:23:55Z)
• Heterogenous Memory Augmented Neural Networks [84.29338268789684]
  We introduce a novel heterogeneous memory augmentation approach for neural networks. By introducing learnable memory tokens with attention mechanism, we can effectively boost performance without huge computational overhead. We show our approach on various image and graph-based tasks under both in-distribution (ID) and out-of-distribution (OOD) conditions.
  arXiv  Detail & Related papers  (2023-10-17T01:05:28Z)
• Self-Supervised Neuron Segmentation with Multi-Agent Reinforcement Learning [53.00683059396803]
  Mask image model (MIM) has been widely used due to its simplicity and effectiveness in recovering original information from masked images. We propose a decision-based MIM that utilizes reinforcement learning (RL) to automatically search for optimal image masking ratio and masking strategy. Our approach has a significant advantage over alternative self-supervised methods on the task of neuron segmentation.
  arXiv  Detail & Related papers  (2023-10-06T10:40:46Z)
• Capturing functional connectomics using Riemannian partial least squares [0.0]
  For neurological disorders and diseases, functional and anatomical connectomes of the human brain can be used to better inform interventions and treatment strategies. One approach to analysing functional connectivity is using partial least squares (PLS), a multivariate regression technique designed for high-dimensional predictor data.
  arXiv  Detail & Related papers  (2023-06-30T02:24:34Z)
• Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework [74.25493157757943]
  We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
  arXiv  Detail & Related papers  (2022-11-03T08:18:27Z)
• Functional Parcellation of fMRI data using multistage k-means clustering [0.9786690381850356]
  Clustering is often used to generate functional parcellation. In this work, we present a clustering algorithm for resting state and task fMRI data.
  arXiv  Detail & Related papers  (2022-02-19T20:30:02Z)
• A deep learning model for data-driven discovery of functional connectivity [0.0]
  We propose a deep learning architecture BrainGNN that learns the connectivity structure as part of learning to classify subjects. We demonstrate the model's state-of-the-art classification performance on a schizophrenia fMRI dataset.
  arXiv  Detail & Related papers  (2021-12-07T21:57:32Z)
• Multi-way Clustering and Discordance Analysis through Deep Collective Matrix Tri-Factorization [9.283501363468728]
  We advance the state-of-the-art in neural unsupervised learning to analyze Heterogeneous multi-typed, multimodal relational data. We design the first neural method for collective matrix tri-factorization of arbitrary collections of matrices to perform spectral clustering of all constituent entities and learn cluster associations. We illustrate its utility in quality assessment of knowledge bases and in improving representation learning.
  arXiv  Detail & Related papers  (2021-09-27T16:24:23Z)
• Clustering Ensemble Meets Low-rank Tensor Approximation [50.21581880045667]
  This paper explores the problem of clustering ensemble, which aims to combine multiple base clusterings to produce better performance than that of the individual one. We propose a novel low-rank tensor approximation-based method to solve the problem from a global perspective. Experimental results over 7 benchmark data sets show that the proposed model achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-12-16T13:01:37Z)
• Deep Representational Similarity Learning for analyzing neural signatures in task-based fMRI dataset [81.02949933048332]
  This paper develops Deep Representational Similarity Learning (DRSL), a deep extension of Representational Similarity Analysis (RSA) DRSL is appropriate for analyzing similarities between various cognitive tasks in fMRI datasets with a large number of subjects.
  arXiv  Detail & Related papers  (2020-09-28T18:30:14Z)
• A New Validity Index for Fuzzy-Possibilistic C-Means Clustering [6.174448419090291]
  Fuzzy-Possibilistic (FP) index works well in the presence of clusters that vary in shape and density. FPCM requires a priori selection of the degree of fuzziness and the degree of typicality.
  arXiv  Detail & Related papers  (2020-05-19T01:48:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.