Accès direct au contenu

CMLA

Version anglaise

aide

Accueil > Publications > Thèses du CMLA

Méthodes régularisées pour la prédiction dans les graphes dynamiques et applications au e-marketing

le 21 novembre 2012
17 heures

Thèse d'Emile RICHARD, CMLA - ENS de Cachan. Regularization Methods for Prediction in Dynamic Graphs and e-Marketing Applications

EmileRichard.jpg

EmileRichard.jpg

La thèse d'Emile Richard est consultable en ligne à cette adresse.

Abstract:

Predicting connections among objects, based either on a noisy observation or on a sequence of observations, is a problem of interest for numerous applications such as recommender systems for e-commerce and social networks, and also in system biology, for inferring interaction patterns among proteins. This work presents formulations of the graph prediction problem, in both dynamic and static scenarios, as
regularization problems. In the static scenario we encode the mixture of two different kinds of structural assumptions in a convex penalty involving the L1 and the trace norm.  In the dynamic setting we assume that certain graph features, such as the node degree, follow a vector autoregressive model and we propose to use this information to improve the accuracy of prediction. The solutions of the optimization problems
are studied both from an algorithmic and statistical point of view.
Empirical evidences on synthetic and real data are presented showing the benefit of using the suggested methods.
Type :
Thèses - HDR
Lieu(x) :
salle Condorcet, bâtiment d'Alembert

Recherche d'une actualité

Recherche d'une actualité