Multiple-View Spectral Clustering for Group-wise Functional Community Detection
Functional connectivity analysis yields powerful insights into our understanding of the human brain. Group-wise functional community detection aims to partition the brain into clusters, or communities, in which functional activity is inter-regionally correlated in a common manner across a group of subjects. In this article, we show how to use multiple-view spectral clustering to perform group-wise functional community detection. In a series of experiments on 291 subjects from the Human Connectome Project, we compare three versions of multiple-view spectral clustering: MVSC (uniform weights), MVSCW (weights based on subject-specific embedding quality), and AASC (weights optimized along with the embedding) with the competing technique of Joint Diagonalization of Laplacians (JDL). Results show that multiple-view spectral clustering not only yields group-wise functional communities that are more consistent than JDL when using randomly selected subsets of individual brains, but it is several orders of magnitude faster than JDL.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringCommunity DetectionFunctional ConnectivitySimilar Papers 제목 키워드 기반
Phase-Consistent Magnetic Spectral Learning for Multi-View Clustering
Unsupervised multi-view clustering (MVC) aims to partition data into meaningful groups by leveraging complementary information from multiple views without labels, yet a central challenge is to obtain a reliable shared st…
Representation LearningA Comprehensive Survey on Spectral Clustering with Graph Structure Learning
Spectral clustering is a powerful technique for clustering high-dimensional data, utilizing graph-based representations to detect complex, non-linear structures and non-convex clusters. The construction of a similarity g…
Clusteringgraph constructionGraph structure learningSurveyConvex Sparse Spectral Clustering: Single-view to Multi-view
Spectral Clustering (SC) is one of the most widely used methods for data clustering. It first finds a low-dimensonal embedding $U$ of data by computing the eigenvectors of the normalized Laplacian matrix, and then perfor…
ClusteringHyperspectral Band Selection via Spatial-Spectral Weighted Region-wise Multiple Graph Fusion-Based Spectral Clustering
In this paper, we propose a hyperspectral band selection method via spatial-spectral weighted region-wise multiple graph fusion-based spectral clustering, referred to as RMGF briefly. Considering that different objects h…
ClusteringSuperpixelsMulti-view Spectral Clustering on the Grassmannian Manifold With Hypergraph Representation
Graph-based multi-view spectral clustering methods have achieved notable progress recently, yet they often fall short in either oversimplifying pairwise relationships or struggling with inefficient spectral decomposition…
ClusteringRepresentation LearningRiemannian optimization