A generic diffusion kernel for semi-supervised learning

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present a generic diffusion kernel for graph-based semi-supervised learning, whose kernel matrix is generated with a Taylor expansion on the generating function of diffusion similarity matrix. The generic diffusion kernel subsumes common known diffusion kernels, and provides a kernel framework for semi-supervised learning. Specifically, we first present the definition of diffusion similarity matrix, and lay the theoretical foundation for our approach. Then we derive the 2- and d-diffusion kernels, and naturally extend them to the generic diffusion kernel. Further we prove that small eigenvalues of the generic diffusion kernel correspond to smooth eigenvectors over the graph. This property is critical for the construction of generic diffusion kernels. Experiments on simulated and benchmark databases demonstrate that the generic diffusion kernel is sound and effective. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Jia, L., & Liao, S. (2008). A generic diffusion kernel for semi-supervised learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5263 LNCS, pp. 723–732). Springer Verlag. https://doi.org/10.1007/978-3-540-87732-5_81

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free