Offre en lien avec l’Action/le Réseau : – — –/– — –

Laboratoire/Entreprise : LISIC – Univ. Littoral Côte d’Opale
Durée : 3 years
Contact : esteban.bautista@univ-littoral.fr
Date limite de publication : 2025-06-01

Contexte :
Many real-world systems — such as industrial IoT networks, online marketplaces, and social platforms — produce data that naturally forms temporal graphs, where each interaction represents who interacted with whom, and when. Temporal graphs offer a powerful way to capture the evolving structure of complex systems and are key to detecting critical phenomena like fraud, cyberattacks, or the spread of misinformation. However, building machine learning tools for temporal graphs remains a major challenge, as common notions of similarity — essential for tasks like classification, prediction, or anomaly detection — are not easily defined in this context.

This PhD project tackles that challenge by developing interpretable methods to compare temporal graphs. The core idea is to use tensor decompositions, which naturally represent temporal graphs as three-dimensional arrays and break them down into simpler/elementary building blocks. Such temporal graph “atoms” can be leveraged to identify what fundamental building blocks are common and different across temporal graph instances, resulting in a set of tools that not only enhance machine learning on temporal graphs but also offer insights into the underlying patterns driving complex systems.

Sujet :
This PhD project aims to lay the foundation for interpretable machine learning on temporal graphs by developing similarity metrics that reveal meaningful patterns across time-evolving systems. To achieve this, we pursue three main goals:

Goal 1: A new tensor decomposition for temporal graphs.
We will develop a decomposition method tailored to the unique challenges of temporal graphs — including their binary and sparse nature, multi-scale patterns, and varying node sets or time intervals. Existing approaches fall short in capturing these aspects jointly. Our method will extend recent advances in geometric and coupled decompositions to extract shared and distinct motifs across graphs.

Goal 2: Similarity metrics, machine learning tasks, and toolbox.
Using our decomposition, we will define interpretable metrics that compare temporal graphs based on their structure, dynamics, and scale. These metrics will power machine learning algorithms for clustering, segmentation, change detection, and prediction. All methods will be implemented in a unified Python toolbox.

Goal 3: Applications to real-world data.
We will validate our methods on two domains. On Wikipedia, we aim to uncover patterns behind successful collaborations by analyzing contributor interactions. In Industry 4.0 settings, we will detect abnormal behaviors in sensor networks to identify faults or cyberattacks.

Profil du candidat :
We look for highly motivated candidates with relevant experience in computer science, data science, and graph machine learning. Experience in Python programming and signal processing will be a plus.

Interested candidates are invited to send an e-mail to
• esteban.bautista@univ-littoral.fr
• laurent.brisson@imt-atlantique.fr
• matthieu.puigt@univ-littoral.fr
while attaching the documents that can support their application:
• your resume;
• a cover letter;
• your transcripts from the last year of B.Sc to the last year of M.Sc. (if the latter is already available)
• two reference letters or the names and means of contact of two academic advisers.

Applications will be reviewed on a rolling basis until the position is filled.

Formation et compétences requises :

Adresse d’emploi :
LISIC Laboratory – Université du Littoral Côte d’Opale – Site Saint-Omer (Hautes-de-France), France

Document attaché : 202504141906_PhD_Data2Laws.pdf