Community Detection from Multiple Observations: from Product Graph Model to Brain Applications
This paper proposes a multilayer graph model for the community detection from multiple observations. This is a very frequent situation, when different estimators are applied to infer graph edges from signals at its nodes, or when different signal measurements are carried out. The multilayer network stacks the graph observations at the different layers, and it links replica nodes at adjacent layers. This configuration matches the Cartesian product between the ground truth graph and a path graph, where the number of nodes corresponds to the number of the observations. Stemming on the algebraic structure of the Laplacian of the Cartesian multilayer network, we infer a subset of the eigenvectors of the true graph and perform community detection. Experimental results on synthetic graphs prove the accuracy of the method, which outperforms state-of-the-art approaches in terms of ability of correctly detecting graph communities. Finally, we show the application of our method to discriminate different brain networks derived from real EEG data collected during motor imagery experiments. We conclude that our approach appears promising in identifying graph communities when multiple observations of the graph are available and it results promising for EEG-based motor imagery applications.
Code (0)
등록된 구현이 없습니다.
Tasks
Community DetectionEEGMotor ImagerySimilar Papers 제목 키워드 기반
Semidefinite Programming for Community Detection with Side Information
This paper produces an efficient Semidefinite Programming (SDP) solution for community detection that incorporates non-graph data, which in this context is known as side information. SDP is an efficient solution for stan…
Community DetectionEfficient Minimax Signal Detection on Graphs
Several problems such as network intrusion, community detection, and disease outbreak can be described by observations attributed to nodes or edges of a graph. In these applications presence of intrusion, community or di…
Community DetectionPopularity Adjusted Block Models are Generalized Random Dot Product Graphs
We connect two random graph models, the Popularity Adjusted Block Model (PABM) and the Generalized Random Dot Product Graph (GRDPG), by demonstrating that the PABM is a special case of the GRDPG in which communities corr…
ClusteringCommunity Detectionparameter estimationUnsupervised Constrained Community Detection via Self-Expressive Graph Neural Network
Graph neural networks (GNNs) are able to achieve promising performance on multiple graph downstream tasks such as node classification and link prediction. Comparatively lesser work has been done to design GNNs which can …
ClusteringCommunity DetectionGraph Neural NetworkLink Prediction+1Community and hyperedge inference in multiple hypergraphs
Hypergraphs, capable of representing high-order interactions via hyperedges, have become a powerful tool for modeling real-world biological and social systems. Inherent relationships within these real-world systems, such…
Community DetectionHyperedge PredictionStochastic Block Model