Interpolating splines on graphs for data science applications

DOI10.1016/J.ACHA.2020.06.001zbMATH Open1442.41001arXiv1806.10695OpenAlexW3033695162MaRDI QIDQ778025FDOQ778025

Authors: J. Ward, F. J. Narcowich, J. D. Ward 

Publication date: 30 June 2020

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: We introduce intrinsic interpolatory bases for data structured on graphs and derive properties of those bases. Polyharmonic Lagrange functions are shown to satisfy exponential decay away from their centers. The decay depends on the density of the zeros of the Lagrange function, showing that they scale with the density of the data. These results indicate that Lagrange-type bases are ideal building blocks for analyzing data on graphs, and we illustrate their use in kernel-based machine learning applications.

Full work available at URL: https://arxiv.org/abs/1806.10695

Recommendations

• Graph signal interpolation with positive definite graph basis functions
• Variational splines and Paley-Wiener spaces on Combinatorial graphs
• scientific article; zbMATH DE number 16807
• scientific article; zbMATH DE number 1864551
• Sparse data interpolation and smoothing on embedded submanifolds

zbMATH Keywords

interpolationLagrange functionskernel-based machine learninglocal basis functions

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Spline approximation (41A15) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Cites Work

• Title not available (Why is that?)
• Kernels and regularization on graphs.
• Title not available (Why is that?)
• Scattered Data Approximation
• Sampling in Paley-Wiener spaces on combinatorial graphs
• A sampling theorem on homogeneous manifolds
• Sampling, filtering and sparse approximations on combinatorial graphs
• Variational splines and Paley-Wiener spaces on Combinatorial graphs
• Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
• Wiener’s lemma for infinite matrices
• Polyharmonic and related kernels on manifolds: interpolation and approximation
• Localized bases for kernel spaces on the unit sphere
• Kernel Approximation on Manifolds I: Bounding the Lebesgue Constant
• Poincaré and Plancherel--Polya Inequalities in Harmonic Analysis on Weighted Combinatorial Graphs
• Title not available (Why is that?)
• Introduction to analysis on graphs
• The penalized Lebesgue constant for surface spline interpolation

Cited In (10)

• Sobolev orthogonal polynomials on the Sierpinski gasket
• Graph signal sampling and interpolation based on clusters and averages
• Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
• Graph signal interpolation with positive definite graph basis functions
• Exploration of kernel parameters in signal GBF-PUM approximation on graphs
• A general multipurpose interpolation procedure: The magic points
• Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
• Partition of unity methods for signal processing on graphs
• Numerical integration on graphs: Where to sample and how to weigh
• GBFPUM -- a MATLAB package for partition of unity based signal interpolation and approximation on graphs

Uses Software

• UCI-ml

This page was built for publication: Interpolating splines on graphs for data science applications

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