3-5 juil. 2013 Villeneuve d'Ascq (Lille) (France)

Par auteur > Raom Jan

Jeudi 4
Apprentissage Automatique

› 17:00 - 17:30 (30min)
Learning from networked examples in a k-partite graph
Jan Raom  1@  , Yuyi Wang  1@  
1 : Katholieke Universiteit Leuven  (KUL)  -  Site web
Celestijnenlaan 200D, BE-3001 Heverlee -  Belgique

Many machine learning algorithms are based on the assumption that training examples are drawn independently. However, this assumption does not hold anymore when learning from a networked examples, i.e. examples sharing pieces of information (such as vertices or edges). We propose an efficient weighting method for learning from networked examples and show a sample error bound which is better than previous work.

Personnes connectées : 1