Learning from Multiple Graphs using a Sigmoid Kernel - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Learning from Multiple Graphs using a Sigmoid Kernel

(1, 2) , (1) , (1, 3) , (1, 3)
1
2
3

Abstract

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.
Fichier principal
Vignette du fichier
main.pdf (153.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00913237 , version 1 (03-12-2013)

Identifiers

  • HAL Id : hal-00913237 , version 1

Cite

Thomas Ricatte, Gemma C. Garriga, Rémi Gilleron, Marc Tommasi. Learning from Multiple Graphs using a Sigmoid Kernel. The 12th International Conference on Machine Learning and Applications (ICMLA'13), Dec 2013, Miami, United States. ⟨hal-00913237⟩
232 View
441 Download

Share

Gmail Facebook Twitter LinkedIn More