Kernels and regularization on graphs

dc.contributor.authorSmola, Alexander J.en
dc.contributor.authorKondor, Risien
dc.date.accessioned2025-05-30T00:28:15Z
dc.date.available2025-05-30T00:28:15Z
dc.date.issued2003en
dc.description.abstractWe 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.en
dc.description.statusPeer-revieweden
dc.format.extent15en
dc.identifier.issn0302-9743en
dc.identifier.scopus9444285502en
dc.identifier.urihttp://www.scopus.com/inward/record.url?scp=9444285502&partnerID=8YFLogxKen
dc.identifier.urihttps://hdl.handle.net/1885/733754491
dc.language.isoenen
dc.relation.ispartofseries16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003en
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.titleKernels and regularization on graphsen
dc.typeConference paperen
dspace.entity.typePublicationen
local.bibliographicCitation.lastpage158en
local.bibliographicCitation.startpage144en
local.contributor.affiliationSmola, Alexander J.; School of Computing, ANU College of Systems and Society, The Australian National Universityen
local.contributor.affiliationKondor, Risi; Columbia Universityen
local.identifier.ariespublicationMigratedxPub18433en
local.identifier.citationvolume2777en
local.identifier.doi10.1007/978-3-540-45167-9_12en
local.identifier.pure6a9d932c-a626-4a2f-86f6-e11d5db3547cen
local.identifier.urlhttps://www.scopus.com/pages/publications/9444285502en
local.type.statusPublisheden

Downloads