Skip to Main content Skip to Navigation

Détection d'événements et inférence de structure pour des vecteurs sur graphes

Abstract : This thesis addresses different problems around the analysis and the modeling of graph signals i.e. vector data that are observed over graphs. In particular, we are interested in two tasks. The rst one is the problem of event detection, i.e. anomaly or changepoint detection, in a set of graph vectors. The second task concerns the inference of the graph structure underlying the observed graph vectors contained in a data set. At first, our work takes an application oriented aspect in which we propose a method for detecting antenna failures or breakdowns in a telecommunication network. The proposed approach is designed to be eective for communication networks in a broad sense and it implicitly takes into account the underlying graph structure of the data. In a second time, a new method for graph structure inference within the framework of Graph Signal Processing is investigated. In this problem, notions of both local and globalsmoothness, with respect to the underlying graph, are imposed to the vectors.Finally, we propose to combine the graph learning task with the change-point detection problem. This time, a probabilistic framework is considered to model the vectors, assumed to be distributed from a specifc Markov Random Field. In the considered modeling, the graph underlying the data is allowed to evolve in time and a change-point is actually detected whenever this graph changes significantly
Document type :
Complete list of metadata
Contributor : Abes Star :  Contact
Submitted on : Tuesday, April 27, 2021 - 2:46:11 PM
Last modification on : Thursday, April 29, 2021 - 3:34:50 AM


Version validated by the jury (STAR)


  • HAL Id : tel-03202003, version 2


Batiste Le Bars. Détection d'événements et inférence de structure pour des vecteurs sur graphes. Statistics [math.ST]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASM003⟩. ⟨tel-03202003v2⟩



Record views


Files downloads