LEARNING CAUSAL NETWORKS TOPOLOGY FROM STREAMING GRAPH SIGNALS - ANR - Agence nationale de la recherche Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

LEARNING CAUSAL NETWORKS TOPOLOGY FROM STREAMING GRAPH SIGNALS

Mircea Moscu
  • Fonction : Auteur
  • PersonId : 1110480
Roula Nassif
  • Fonction : Auteur
  • PersonId : 1131931
Cédric Richard

Résumé

Modern data analysis and processing tasks usually involve large sets of data structured by a graph. Typical examples include brain activity supported by neurons, data shared by users of social media, and traffic on transportation or energy networks. There are often settings where the graph is not readily available, and has to be estimated from data. This paper focuses on estimating a network structure capturing the dependencies among streaming graph signals in the form of a possibly directed, weighted adjacency matrix. Several works proposed centralized offline solutions to address this problem, without paying much attention to the distributed nature of networks. We start from a centralized setting and show how, by introducing a simple yet powerful data model, we can infer a graph structure from streaming data with a distributed online learning algorithm. Our algorithm is tested experimentally to illustrate its usefulness, and successfully compared to a centralized offline solution of the literature.
Fichier principal
Vignette du fichier
moscu2019distributed.pdf (1.28 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03634139 , version 1 (07-04-2022)

Identifiants

Citer

Mircea Moscu, Roula Nassif, Fei Hua, Cédric Richard. LEARNING CAUSAL NETWORKS TOPOLOGY FROM STREAMING GRAPH SIGNALS. 2019 27th European Signal Processing Conference (EUSIPCO), Sep 2019, A Coruna, France. pp.1-5, ⟨10.23919/EUSIPCO.2019.8902826⟩. ⟨hal-03634139⟩
10 Consultations
46 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More