Community Detection in Bipartite Networks with Stochastic Blockmodels

• URL: http://arxiv.org/abs/2001.11818v2
• Date: Tue, 29 Sep 2020 07:38:24 GMT
• Title: Community Detection in Bipartite Networks with Stochastic Blockmodels
• Authors: Tzu-Chi Yen, Daniel B. Larremore
• Abstract summary: In bipartite networks, community structures are restricted to being disassortative, in that nodes of one type are grouped according to common patterns of connection with nodes of the other type. This makes the block model (SBM) an intuitive choice for bipartite community detection. We introduce a nonparametric formulation of the SBM and a corresponding algorithm to efficiently find communities in bipartite networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In bipartite networks, community structures are restricted to being disassortative, in that nodes of one type are grouped according to common patterns of connection with nodes of the other type. This makes the stochastic block model (SBM), a highly flexible generative model for networks with block structure, an intuitive choice for bipartite community detection. However, typical formulations of the SBM do not make use of the special structure of bipartite networks. Here we introduce a Bayesian nonparametric formulation of the SBM and a corresponding algorithm to efficiently find communities in bipartite networks which parsimoniously chooses the number of communities. The biSBM improves community detection results over general SBMs when data are noisy, improves the model resolution limit by a factor of $\sqrt{2}$, and expands our understanding of the complicated optimization landscape associated with community detection tasks. A direct comparison of certain terms of the prior distributions in the biSBM and a related high-resolution hierarchical SBM also reveals a counterintuitive regime of community detection problems, populated by smaller and sparser networks, where nonhierarchical models outperform their more flexible counterpart.

Related papers

• Community Detection in the Multi-View Stochastic Block Model [47.43048484980115]
  This paper considers the problem of community detection on multiple potentially correlated graphs from antheoretical perspective. We first put forth a random graph model, called the multi-view information block model (MVSBM), designed to generate correlated graphs on the same set of nodes.
  arXiv  Detail & Related papers  (2024-01-17T13:39:38Z)
• A stochastic block model for community detection in attributed networks [7.128313939076842]
  Existing community detection methods mostly focus on network structure, while the methods of integrating node attributes is mainly for the traditional community structures. A block model that integrates betweenness centrality and clustering coefficient of nodes for community detection in attributed networks is proposed in this paper. The performance of this model is superior to other five compared algorithms.
  arXiv  Detail & Related papers  (2023-08-31T01:00:24Z)
• Bipartite mixed membership distribution-free model. A novel model for community detection in overlapping bipartite weighted networks [0.4972323953932129]
  We introduce a novel model, the Bipartite Mixed Membership Distribution-Free (BiMMDF) model. Our model allows an adjacency matrix to follow any distribution as long as its expectation has a block structure related to node membership. An efficient algorithm with a theoretical guarantee of consistent estimation is applied to fit BiMMDF.
  arXiv  Detail & Related papers  (2022-11-02T06:26:47Z)
• Community detection for weighted bipartite networks [1.0965065178451106]
  citerohe2016co proposed co-Blockmodel (ScBM) as a tool for detecting community structure of binary bipartite graph data in network studies. Here, to model a weighted bipartite network, we introduce a Bipartite Distribution-Free model by releasing ScBM's distribution restriction. Our models do not require a specific distribution on generating elements of the adjacency matrix but only a block structure on the expected adjacency matrix.
  arXiv  Detail & Related papers  (2021-09-21T17:01:36Z)
• Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
  This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM) We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
  arXiv  Detail & Related papers  (2021-05-11T03:39:08Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Dual-constrained Deep Semi-Supervised Coupled Factorization Network with Enriched Prior [80.5637175255349]
  We propose a new enriched prior based Dual-constrained Deep Semi-Supervised Coupled Factorization Network, called DS2CF-Net. To ex-tract hidden deep features, DS2CF-Net is modeled as a deep-structure and geometrical structure-constrained neural network. Our network can obtain state-of-the-art performance for representation learning and clustering.
  arXiv  Detail & Related papers  (2020-09-08T13:10:21Z)
• A Multi-Semantic Metapath Model for Large Scale Heterogeneous Network Representation Learning [52.83948119677194]
  We propose a multi-semantic metapath (MSM) model for large scale heterogeneous representation learning. Specifically, we generate multi-semantic metapath-based random walks to construct the heterogeneous neighborhood to handle the unbalanced distributions. We conduct systematical evaluations for the proposed framework on two challenging datasets: Amazon and Alibaba.
  arXiv  Detail & Related papers  (2020-07-19T22:50:20Z)
• Extended Stochastic Block Models with Application to Criminal Networks [3.2211782521637393]
  We study covert networks that encode relationships among criminals. The coexistence of noisy block patterns limits the reliability of routinely-used community detection algorithms. We develop a new class of extended block models (ESBM) that infer groups of nodes having common connectivity patterns.
  arXiv  Detail & Related papers  (2020-07-16T19:06:16Z)
• Consistency of Spectral Clustering on Hierarchical Stochastic Block Models [5.983753938303726]
  We study the hierarchy of communities in real-world networks under a generic block model. We prove the strong consistency of this method under a wide range of model parameters. Unlike most of existing work, our theory covers multiscale networks where the connection probabilities may differ by orders of magnitude.
  arXiv  Detail & Related papers  (2020-04-30T01:08:59Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)

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.