Public thesis defense of Pierre Leleux
-
Thursday, 02 February 2023, 08h00Thursday, 02 February 2023, 17h00
-
Contactp.leleux@uclouvain.be
Network (or graph) data analysis finds applications in many contexts, including biology, finance, marketing, and physics, to name a few. With the recent thriving of internet and social networks, these graph mining techniques have grown in popularity as an important tool to process, analyze, and make predictions from the quickly increasing amount of network data. This thesis mostly focuses on the randomized shortest path (RSP) framework, which defines a family of dissimilarities between nodes of a network that interpolates between the least cost path distance (optimal behavior) and the commute-cost distance (purely random behavior). This thesis therefore builds upon and extends this framework by proposing, among others, new dissimilarity measures, a design of biased random walk, as well as fast solutions to approximate the RSP for large graphs. It also explores various applications like node clustering, stochastic Markov decision processes, connectivity modeling in ecological landscapes, and collaborative filtering.
For the good organisation of this event, please inform Pierre Leleux of your presence.