Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
DOI10.1016/j.cam.2022.114951OpenAlexW3134400604MaRDI QIDQ2112685
Wolfgang Erb, Salvatore Cuomo, Gabriele Santin
Publication date: 11 January 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.01575
Gaussian process regression on graphsgraph basis functions (GBFs)influence maximization (IM) on graphskernel-based inference in machine learningoptimal design of sampling nodesP-greedy methods
Social networks; opinion dynamics (91D30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical interpolation (65D05) Multidimensional problems (41A63) Interpolation in approximation theory (41A05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bases for kernel-based spaces
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Interpolating splines on graphs for data science applications
- Optimal monitoring network designs
- Vertex-frequency analysis on graphs
- Near-optimal data-independent point locations for radial basis function interpolation
- Error estimates and condition numbers for radial basis function interpolation
- Greedy algorithms for matrix-valued kernels
- Partition of unity methods for signal processing on graphs
- Graph signal interpolation with positive definite graph basis functions
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- Kernel-based Approximation Methods using MATLAB
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- 9 Kernel methods for surrogate modeling
- An analysis of approximations for maximizing submodular set functions—I
- The centrality of groups and classes
- Stationary Signal Processing on Graphs
- Gaussian Markov Random Fields
- Shapes of Uncertainty in Spectral Graph Theory
- Convergence rate of the data-independent $P$-greedy algorithm in kernel-based approximation
- Maximizing Social Influence in Nearly Optimal Time
- Scattered Data Approximation
This page was built for publication: Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
