Model-based clustering for populations of networks

06/01/2018
by   Mirko Signorelli, et al.
0

We propose a model-based clustering method for populations of networks that describes the joint distribution of a sequence of networks in a parsimonious manner, and can be used to identify subpopulations of networks that share certain topological properties of interest. We discuss how maximum likelihood estimation can be performed with the EM algorithm and study the performance of the proposed method on simulated data. We conclude with an example application to a sequence of face-to-face interaction networks measured in an office environment.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2021

Maximum Approximate Bernstein Likelihood Estimation of Densities in a Two-sample Semiparametric Model

Maximum likelihood estimators are proposed for the parameters and the de...
research
11/21/2017

Model-based Clustering with Sparse Covariance Matrices

Finite Gaussian mixture models are widely used for model-based clusterin...
research
06/05/2016

Relaxation of the EM Algorithm via Quantum Annealing

The EM algorithm is a novel numerical method to obtain maximum likelihoo...
research
07/28/2022

Model based clustering of multinomial count data

We consider the problem of inferring an unknown number of clusters in re...
research
02/27/2023

Detecting Jumps on a Tree: a Hierarchical Pitman-Yor Model for Evolution of Phenotypic Distributions

This work focuses on clustering populations with a hierarchical dependen...
research
10/25/2022

Arc travel time and path choice model estimation subsumed

We propose a method for maximum likelihood estimation of path choice mod...
research
02/10/2017

Generative Mixture of Networks

A generative model based on training deep architectures is proposed. The...

Please sign up or login with your details

Forgot password? Click here to reset