Kernels and regularization on graphs

Alexander J. Smola*, Risi Kondor

*Corresponding author for this work

    Research output: Contribution to journalConference articlepeer-review

    530 Citations (Scopus)

    Abstract

    We introduce a family of kernels on graphs based on the notion of regularization operators. This generalizes in a natural way the notion of regularization and Greens functions, as commonly used for real valued functions, to graphs. It turns out that diffusion kernels can be found as a special case of our reasoning. We show that the class of positive, monotonically decreasing functions on the unit interval leads to kernels and corresponding regularization operators.

    Original languageEnglish
    Pages (from-to)144-158
    Number of pages15
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2777
    DOIs
    Publication statusPublished - 2003
    Event16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003 - Washington, DC, United States
    Duration: 24 Aug 200327 Aug 2003

    Fingerprint

    Dive into the research topics of 'Kernels and regularization on graphs'. Together they form a unique fingerprint.

    Cite this