Learning from Multiple Graphs using a ...
Document type :
Communication dans un congrès avec actes
Title :
Learning from Multiple Graphs using a Sigmoid Kernel
Author(s) :
Ricatte, Thomas [Auteur]
Machine Learning in Information Networks [MAGNET]
Garriga, Gemma [Auteur]
Machine Learning in Information Networks [MAGNET]
Gilleron, Remi [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Machine Learning in Information Networks [MAGNET]
Tommasi, Marc [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Machine Learning in Information Networks [MAGNET]
Machine Learning in Information Networks [MAGNET]
Garriga, Gemma [Auteur]
Machine Learning in Information Networks [MAGNET]
Gilleron, Remi [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Machine Learning in Information Networks [MAGNET]
Tommasi, Marc [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Machine Learning in Information Networks [MAGNET]
Conference title :
The 12th International Conference on Machine Learning and Applications (ICMLA'13)
City :
Miami
Country :
Etats-Unis d'Amérique
Start date of the conference :
2013-12-04
Publication date :
2013-12-04
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [en]
This paper studies the problem of learning from a set of input graphs, each of them representing a different relation over the same set of nodes. Our goal is to merge those input graphs by embedding them into an Euclidean ...
Show more >This paper studies the problem of learning from a set of input graphs, each of them representing a different relation over the same set of nodes. Our goal is to merge those input graphs by embedding them into an Euclidean space related to the commute time distance in the original graphs. This is done with the help of a small number of labeled nodes. Our algorithm output a combined kernel that can be used for different graph learning tasks. We consider two combination methods: the (classical) linear combination and the sigmoid combination. We compare the combination methods on node classification tasks using different semi-supervised graph learning algorithms. We note that the sigmoid combination method exhibits very positive results.Show less >
Show more >This paper studies the problem of learning from a set of input graphs, each of them representing a different relation over the same set of nodes. Our goal is to merge those input graphs by embedding them into an Euclidean space related to the commute time distance in the original graphs. This is done with the help of a small number of labeled nodes. Our algorithm output a combined kernel that can be used for different graph learning tasks. We consider two combination methods: the (classical) linear combination and the sigmoid combination. We compare the combination methods on node classification tasks using different semi-supervised graph learning algorithms. We note that the sigmoid combination method exhibits very positive results.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-00913237/document
- Open access
- Access the document
- https://hal.inria.fr/hal-00913237/document
- Open access
- Access the document
- document
- Open access
- Access the document
- main.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- main.pdf
- Open access
- Access the document