VEC-SBM: Optimal Community Detection with Vectorial Edges Covariates
- URL: http://arxiv.org/abs/2402.18805v1
- Date: Thu, 29 Feb 2024 02:19:55 GMT
- Title: VEC-SBM: Optimal Community Detection with Vectorial Edges Covariates
- Authors: Guillaume Braun and Masashi Sugiyama
- Abstract summary: We study an extension of the Block Model (SBM), a widely used statistical framework for community detection.
We propose a novel algorithm based on iterative refinement techniques and show that it optimally recovers the latent communities.
We rigorously assess the added value of leveraging edge's side information in the community detection process.
- Score: 67.51637355249986
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Social networks are often associated with rich side information, such as
texts and images. While numerous methods have been developed to identify
communities from pairwise interactions, they usually ignore such side
information. In this work, we study an extension of the Stochastic Block Model
(SBM), a widely used statistical framework for community detection, that
integrates vectorial edges covariates: the Vectorial Edges Covariates
Stochastic Block Model (VEC-SBM). We propose a novel algorithm based on
iterative refinement techniques and show that it optimally recovers the latent
communities under the VEC-SBM. Furthermore, we rigorously assess the added
value of leveraging edge's side information in the community detection process.
We complement our theoretical results with numerical experiments on synthetic
and semi-synthetic data.
Related papers
- A Bayesian Methodology for Estimation for Sparse Canonical Correlation [0.0]
Canonical Correlation Analysis (CCA) is a statistical procedure for identifying relationships between data sets.
ScSCCA is a rapidly emerging methodological area that aims for robust modeling of the interrelations between the different data modalities.
We propose a novel ScSCCA approach where we employ a Bayesian infinite factor model and aim to achieve robust estimation.
arXiv Detail & Related papers (2023-10-30T15:14:25Z) - DCID: Deep Canonical Information Decomposition [84.59396326810085]
We consider the problem of identifying the signal shared between two one-dimensional target variables.
We propose ICM, an evaluation metric which can be used in the presence of ground-truth labels.
We also propose Deep Canonical Information Decomposition (DCID) - a simple, yet effective approach for learning the shared variables.
arXiv Detail & Related papers (2023-06-27T16:59:06Z) - Mining Relations among Cross-Frame Affinities for Video Semantic
Segmentation [87.4854250338374]
We explore relations among affinities in two aspects: single-scale intrinsic correlations and multi-scale relations.
Our experiments demonstrate that the proposed method performs favorably against state-of-the-art VSS methods.
arXiv Detail & Related papers (2022-07-21T12:12:36Z) - Bayesian community detection for networks with covariates [16.230648949593153]
"Community detection" has arguably received the most attention in the scientific community.
We propose a block model with a co-dependent random partition prior.
Our model has the ability to learn the number of the communities via posterior inference without having to assume it to be known.
arXiv Detail & Related papers (2022-03-04T01:58:35Z) - Shared Independent Component Analysis for Multi-Subject Neuroimaging [107.29179765643042]
We introduce Shared Independent Component Analysis (ShICA) that models each view as a linear transform of shared independent components contaminated by additive Gaussian noise.
We show that this model is identifiable if the components are either non-Gaussian or have enough diversity in noise variances.
We provide empirical evidence on fMRI and MEG datasets that ShICA yields more accurate estimation of the components than alternatives.
arXiv Detail & Related papers (2021-10-26T08:54:41Z) - Partial Counterfactual Identification from Observational and
Experimental Data [83.798237968683]
We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data.
Our algorithms are validated extensively on synthetic and real-world datasets.
arXiv Detail & Related papers (2021-10-12T02:21:30Z) - Amortized Probabilistic Detection of Communities in Graphs [39.56798207634738]
We propose a simple framework for amortized community detection.
We combine the expressive power of GNNs with recent methods for amortized clustering.
We evaluate several models from our framework on synthetic and real datasets.
arXiv Detail & Related papers (2020-10-29T16:18:48Z) - SAMBA: Safe Model-Based & Active Reinforcement Learning [59.01424351231993]
SAMBA is a framework for safe reinforcement learning that combines aspects from probabilistic modelling, information theory, and statistics.
We evaluate our algorithm on a variety of safe dynamical system benchmarks involving both low and high-dimensional state representations.
We provide intuition as to the effectiveness of the framework by a detailed analysis of our active metrics and safety constraints.
arXiv Detail & Related papers (2020-06-12T10:40:46Z) - Reliable Time Prediction in the Markov Stochastic Block Model [0.0]
We show how MSBMs can be used to detect dependence structure in growing graphs.
We provide methods to solve the so-called link prediction and collaborative filtering problems.
arXiv Detail & Related papers (2020-04-09T07:58:02Z) - Pairwise Covariates-adjusted Block Model for Community Detection [9.423321226644891]
Community detection is one of the most fundamental problems in network study.
We introduce a pairwise co-adjusted generalization block model (PCABM)
We show that PCABM is consistent under suitable sparsity conditions.
arXiv Detail & Related papers (2018-07-10T03:37:55Z)
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.