paper-with-me

홈 › Papers

Equipping SBMs with RBMs: An Explainable Approach for Analysis of Networks with Covariates

2019-11-11 · Shubham Gupta, Gururaj K., Ambedkar Dukkipati, Rui M. Castro

Networks with node covariates offer two advantages to community detection methods, namely, (i) exploit covariates to improve the quality of communities, and more importantly, (ii) explain the discovered communities by identifying the relative importance of different covariates in them. Recent methods have almost exclusively focused on the first point above. However, the quantitative improvements offered by them are often due to complex black-box models like deep neural networks at the expense of explainability. Approaches that focus on the second point are either domain-specific or have poor performance in practice. This paper proposes explainable, domain-independent statistical models for networks with node covariates that additionally offer good quantitative performance. Our models combine the strengths of Stochastic Block Models and Restricted Boltzmann Machines to provide interpretable insights about the communities. They support both pure and mixed community memberships. Besides providing explainability, our approach's main strength is that it does not explicitly assume a causal direction between community memberships and node covariates, making it applicable in diverse domains. We derive efficient inference procedures for our models, which can, in some cases, run in linear time in the number of nodes and edges. Experiments on several synthetic and real-world networks demonstrate that our models achieve close to state-of-the-art performance on community detection and link prediction tasks while also providing explanations for the discovered communities.

📄 PDF Abstract BibTeX arXiv:1911.04172

Code (0)

등록된 구현이 없습니다.

Tasks

Community DetectionLink Prediction

Methods 이 논문이 사용한 방법론

Restricted Boltzmann Machine 설명 없음

Similar Papers 제목 키워드 기반

On Investigating the Conservative Property of Score-Based Generative Models

2022-09-26 · Chen-Hao Chao, Wei-Fang Sun, Bo-Wun Cheng, Chun-Yi Lee

Existing Score-Based Models (SBMs) can be categorized into constrained SBMs (CSBMs) or unconstrained SBMs (USBMs) according to their parameterization approaches. CSBMs model probability density functions as Boltzmann dis…

Image Generation

Gaussian-binary Restricted Boltzmann Machines on Modeling Natural Image Statistics

2014-01-23 · Nan Wang, Jan Melchior, Laurenz Wiskott

We present a theoretical analysis of Gaussian-binary restricted Boltzmann machines (GRBMs) from the perspective of density models. The key aspect of this analysis is to show that GRBMs can be formulated as a constrained …

blind source separation

Differentially private exact recovery for stochastic block models

2024-06-04 · Dung Nguyen, Anil Vullikanti

Stochastic block models (SBMs) are a very commonly studied network model for community detection algorithms. In the standard form of an SBM, the $n$ vertices (or nodes) of a graph are generally divided into multiple pre-…

Community Detection

Sparse Boltzmann Machines with Structure Learning as Applied to Text Analysis

2016-09-17 · Zhourong Chen, Nevin L. Zhang, Dit-yan Yeung, Peixian Chen

We are interested in exploring the possibility and benefits of structure learning for deep models. As the first step, this paper investigates the matter for Restricted Boltzmann Machines (RBMs). We conduct the study with…

Plug-and-Play Priors as a Score-Based Method

2024-12-15 · Chicago Y. Park, Yuyang Hu, Michael T. McCann, Cristina Garcia-Cardona 외

Plug-and-play (PnP) methods are extensively used for solving imaging inverse problems by integrating physical measurement models with pre-trained deep denoisers as priors. Score-based diffusion models (SBMs) have recentl…

Image Generation