Uncovering Latent Structure in Valued Graphs: A Variational Approach

author: Mahendra Mariadassou, UMR AgroParisTech/INRA 518, Institut National Agronomique Paris-Grignon
published: Dec. 14, 2007,   recorded: October 2007,   views: 124


Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


As more and more network-structured datasets are available, the statistical analysis of valued graphs has become a common place. Looking for a latent structure is one of the many strategies used to better understand the behavior of a network. Several methods already exist for the binary case.We present a model-based strategy to uncover groups of nodes in valued graphs. This framework can be used for a wide span of parametric random graphs models. Variational tools allow us to achieve approximate maximum likelihood estimation of the parameters of these models. We provide a simulation study showing that our estimation method performs well over a broad range of situations.

See Also:

Download slides icon Download slides: eccs07_mariadassou_uls_01.v1.pdf (2.0┬áMB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: