Learning from Multiple Graphs using a Sigmoid Kernel

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-00913237
Contributor : Team Magnet <>
Submitted on : Tuesday, December 3, 2013 - 2:24:16 PM
Last modification on : Thursday, February 21, 2019 - 10:52:55 AM
Long-term archiving on : Monday, March 3, 2014 - 10:55:47 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00913237, version 1

Citation

Thomas Ricatte, Gemma 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⟩

Share

Metrics

Record views

418

Files downloads

515