Bayesian one-mode projection for dynamic bipartite graphs

12/12/2012
by   Ioannis Psorakis, et al.
0

We propose a Bayesian methodology for one-mode projecting a bipartite network that is being observed across a series of discrete time steps. The resulting one mode network captures the uncertainty over the presence/absence of each link and provides a probability distribution over its possible weight values. Additionally, the incorporation of prior knowledge over previous states makes the resulting network less sensitive to noise and missing observations that usually take place during the data collection process. The methodology consists of computationally inexpensive update rules and is scalable to large problems, via an appropriate distributed implementation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2012

Monotonicity in Bayesian Networks

For many real-life Bayesian networks, common knowledge dictates that the...
research
07/31/2021

Bipartite Graft III: General Case

This paper is a sequel of our previous paper (N. Kita: Bipartite graft I...
research
04/22/2021

Bayesian predictive inference without a prior

Let (X_n:n≥ 1) be a sequence of random observations. Let σ_n(·)=P(X_n+1∈...
research
11/27/2018

Bayesian Neural Network Ensembles

Ensembles of neural networks (NNs) have long been used to estimate predi...
research
06/20/2023

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs

We study dynamic (1-ϵ)-approximate rounding of fractional matchings – a ...
research
09/07/2021

Identifying Influential Nodes in Two-mode Data Networks using Formal Concept Analysis

Identifying important actors (or nodes) in a two-mode network often rema...
research
01/10/2013

Hypothesis Management in Situation-Specific Network Construction

This paper considers the problem of knowledge-based model construction i...

Please sign up or login with your details

Forgot password? Click here to reset