3 research outputs found
Bayesian non parametric inference of discrete valued networks
International audienceWe present a non parametric bayesian inference strategy to automatically infer the number of classes during the clustering process of a discrete valued random network. Our methodology is related to the Dirichlet process mixture models and inference is performed using a Blocked Gibbs sampling procedure. Using simulated data, we show that our approach improves over competitive variational inference clustering methods
Exact ICL maximization in a non-stationary temporal extension of the stochastic block model for dynamic networks
The stochastic block model (SBM) is a flexible probabilistic tool that can be
used to model interactions between clusters of nodes in a network. However, it
does not account for interactions of time varying intensity between clusters.
The extension of the SBM developed in this paper addresses this shortcoming
through a temporal partition: assuming interactions between nodes are recorded
on fixed-length time intervals, the inference procedure associated with the
model we propose allows to cluster simultaneously the nodes of the network and
the time intervals. The number of clusters of nodes and of time intervals, as
well as the memberships to clusters, are obtained by maximizing an exact
integrated complete-data likelihood, relying on a greedy search approach.
Experiments on simulated and real data are carried out in order to assess the
proposed methodology
Block modelling in dynamic networks with non-homogeneous Poisson processes and exact ICL
We develop a model in which interactions between nodes of a dynamic network
are counted by non homogeneous Poisson processes. In a block modelling
perspective, nodes belong to hidden clusters (whose number is unknown) and the
intensity functions of the counting processes only depend on the clusters of
nodes. In order to make inference tractable we move to discrete time by
partitioning the entire time horizon in which interactions are observed in
fixed-length time sub-intervals. First, we derive an exact integrated
classification likelihood criterion and maximize it relying on a greedy search
approach. This allows to estimate the memberships to clusters and the number of
clusters simultaneously. Then a maximum-likelihood estimator is developed to
estimate non parametrically the integrated intensities. We discuss the
over-fitting problems of the model and propose a regularized version solving
these issues. Experiments on real and simulated data are carried out in order
to assess the proposed methodology