Kernels and Regularization on Graphs

2003/01/01 by Alexander J. Smola, Risi Kondor · 3 citations
Computer Science · Engineering · Mathematics · #Artificial intelligence #Computer science #Discrete mathematics #Face and Expression Recognition #Mathematical analysis #Mathematics #Matrix Theory and Algorithms #Monotonic function #Regularization (linguistics) #Sparse and Compressive Sensing Techniques #Theoretical computer science

paper · doi:10.1007/978-3-540-45167-9_12

crossref issued 2003/01/01 · crossref published 2003/01/01 · crossref published-print 2003/01/01 · openalex publication_date 2003/01/01 · crossref created 2010/07/22 · crossref deposited 2019/05/31 · openalex created_date 2025/10/10 · crossref indexed 2026/07/07 · openalex updated_date 2026/08/04

Citations

• Discrete Green's functions for products of regular graphs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Authoritative sources in a hyperlinked environment

Cited by

• Graph Kernels
• Edge Dithering for Robust Adaptive Graph Convolutional Networks
• Shing-Tung Yau [wikipedia]