On Learning with Kernels for Unordered Pairs
Abstract
We propose and analyze two strategies to learn over unordered pairs with kernels, and provide a common theoretical framework to compare them. The strategies are related to methods that were recently investigated to predict edges in biological networks. We show that both strategies differ in their loss function and in the kernels they use. We deduce in particular a smooth interpolation between the two approaches, as well as new ways to learn over unordered pairs. The different approaches are tested on the inference of missing edges in two biological networks.
Cite
Text
Hue and Vert. "On Learning with Kernels for Unordered Pairs." International Conference on Machine Learning, 2010.Markdown
[Hue and Vert. "On Learning with Kernels for Unordered Pairs." International Conference on Machine Learning, 2010.](https://mlanthology.org/icml/2010/hue2010icml-learning/)BibTeX
@inproceedings{hue2010icml-learning,
title = {{On Learning with Kernels for Unordered Pairs}},
author = {Hue, Martial and Vert, Jean-Philippe},
booktitle = {International Conference on Machine Learning},
year = {2010},
pages = {463-470},
url = {https://mlanthology.org/icml/2010/hue2010icml-learning/}
}