DeepAI AI Chat
Log In Sign Up

Graph heat mixture model learning

by   Hermina Petric Maretic, et al.

Graph inference methods have recently attracted a great interest from the scientific community, due to the large value they bring in data interpretation and analysis. However, most of the available state-of-the-art methods focus on scenarios where all available data can be explained through the same graph, or groups corresponding to each graph are known a priori. In this paper, we argue that this is not always realistic and we introduce a generative model for mixed signals following a heat diffusion process on multiple graphs. We propose an expectation-maximisation algorithm that can successfully separate signals into corresponding groups, and infer multiple graphs that govern their behaviour. We demonstrate the benefits of our method on both synthetic and real data.


page 1

page 2

page 3

page 4


Graph Laplacian mixture model

Graph learning methods have recently been receiving increasing interest ...

Online Inference for Mixture Model of Streaming Graph Signals with Non-White Excitation

This paper considers a joint multi-graph inference and clustering proble...

Learning heat diffusion graphs

Effective information analysis generally boils down to properly identify...

Graph Learning from Filtered Signals: Graph System and Diffusion Kernel Identification

This paper introduces a novel graph signal processing framework for buil...

Modeling Graphs Using a Mixture of Kronecker Models

Generative models for graphs are increasingly becoming a popular tool fo...

Differentially Describing Groups of Graphs

How does neural connectivity in autistic children differ from neural con...

Kernel-based Reconstruction of Graph Signals

A number of applications in engineering, social sciences, physics, and b...