Kernels on Graphs as Proximity Measures

DOI10.1007/978-3-319-67810-8_3MaRDI QIDQ5045293zbMATH OpenOpenAlexFDO

Authors Dmytro Rubanov, Konstantin Avrachenkov, Pavel Chebotarev

Publication date 4 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-67810-8_3

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Similarities on graphs: kernels versus proximity measures
• Graph kernels
• Graph kernels
• Kernels in random graphs
• Graph kernels: a survey
• Kernels of directed graph Laplacians
• scientific article; zbMATH DE number 3929034
• Kernels and regularization on graphs.
• On proximity measures for graph vertices

Cited in

(6)

• Do logarithmic proximity measures outperform plain ones in graph clustering?
• A Theory of Similarity Functions for Learning and Clustering
• Similarities on graphs: kernels versus proximity measures
• Covariance and correlation measures on a graph in a generalized bag-of-paths formalism
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Propagation kernels: efficient graph kernels from propagated information

This page was built for publication: Kernels on Graphs as Proximity Measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045293)