Format

Send to

Choose Destination
Neural Netw. 2012 Jul;31:53-72. doi: 10.1016/j.neunet.2012.03.001. Epub 2012 Mar 20.

An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification.

Author information

1
Université Catholique de Louvain, ICTEAM & LSM, Louvain-la-Neuve and Mons, Belgium. francois.fouss@uclouvain.be

Abstract

This paper presents a survey as well as an empirical comparison and evaluation of seven kernels on graphs and two related similarity matrices, that we globally refer to as "kernels on graphs" for simplicity. They are the exponential diffusion kernel, the Laplacian exponential diffusion kernel, the von Neumann diffusion kernel, the regularized Laplacian kernel, the commute-time (or resistance-distance) kernel, the random-walk-with-restart similarity matrix, and finally, a kernel first introduced in this paper (the regularized commute-time kernel) and two kernels defined in some of our previous work and further investigated in this paper (the Markov diffusion kernel and the relative-entropy diffusion matrix). The kernel-on-graphs approach is simple and intuitive. It is illustrated by applying the nine kernels to a collaborative-recommendation task, viewed as a link prediction problem, and to a semisupervised classification task, both on several databases. The methods compute proximity measures between nodes that help study the structure of the graph. Our comparisons suggest that the regularized commute-time and the Markov diffusion kernels perform best on the investigated tasks, closely followed by the regularized Laplacian kernel.

PMID:
22497802
DOI:
10.1016/j.neunet.2012.03.001
[Indexed for MEDLINE]

Supplemental Content

Full text links

Icon for Elsevier Science
Loading ...
Support Center