Kernels and regularization on graphs.
From MaRDI portal
Recommendations
Cited in
(72)- Semi-supervised graph clustering: a kernel approach
- Nonparametric Bayesian label prediction on a graph
- An optimization model for collaborative recommendation using a covariance-based regularizer
- Minimax lower bounds for function estimation on graphs
- Optimization approaches to supervised classification
- Learning to rank on graphs
- On the properties of von Neumann kernels for link analysis
- Network diffusion with centrality measures to identify disease-related genes
- Gromov-Hausdorff limit of Wasserstein spaces on point clouds
- Improving maximum margin matrix factorization
- Partition of unity methods for signal processing on graphs
- Network embedding: taxonomies, frameworks and applications
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- Graph signal interpolation with positive definite graph basis functions
- Efficient learning of supervised kernels with a graph-based loss function
- Similarities on graphs: kernels versus proximity measures
- Protein classification by matching and clustering surface graphs
- Dependence maps, a dimensionality reduction with dependence distance for high-dimensional data
- A unified probabilistic framework for robust manifold learning and embedding
- Heat kernel embeddings, differential geometry and graph structure
- Predicting the labels of an unknown graph via adaptive exploration
- The graph matching problem
- A neural network algorithm for semi-supervised node label learning from unbalanced data
- A constrained matrix-variate Gaussian process for transposable data
- scientific article; zbMATH DE number 6378008 (Why is no real title available?)
- Regularization on graphs with function-adapted diffusion processes
- On Bochner's theorem and its application to graph kernels
- Low rank estimation of smooth kernels on graphs
- Learning unknown graphs
- Complexity versus agreement for many views. Co-regularization for multi-view semi-supervised learning
- Adaptive ANOVA decomposition of stochastic incompressible and compressible flows
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- The DFS fused Lasso: linear-time denoising over general graphs
- A combined Weisfeiler-Lehman graph kernel for structured data
- A unified framework for structured graph learning via spectral constraints
- Edge sampling using local network information
- Graph kernels: a survey
- A maximum principle argument for the uniform convergence of graph Laplacian regressors
- Lipschitz regularity of graph Laplacians on random data clouds
- Kernels on Graphs as Proximity Measures
- Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
- Cross-domain metric and multiple kernel learning based on information theory
- Framework for kernel regularization with application to protein clustering
- Learning with Kernels and Logical Representations
- Fast semi-supervised SVM classifiers usinga priorimetric information
- Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks
- Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context
- Kernel discriminant analysis and clustering with parsimonious Gaussian process models
- Ellipsoidal classification via semidefinite programming
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- Recent advances in graph-based pattern recognition with applications in document analysis
- Semi-supervised classification and betweenness computation on large, sparse, directed graphs
- Efficient semi-supervised learning on locally informative multiple graphs
- Trend filtering for functional data
- Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
- Modeling urban crime occurrences via network regularized regression
- Uncertainty quantification for Fisher-Kolmogorov equation on graphs with application to patient-specific Alzheimer's disease
- Varying coefficient regression models on fluvial networks
- The graph bottleneck identity
- Semi-discrete linear curvature flows of curves with boundary
- Skeleton regression: a graph-based approach to estimation with manifold structure
- Surrogate models for diffusion on graphs via sparse polynomials
- Spectral neural networks: approximation theory and optimization landscape
- Data-driven thresholding in denoising with spectral graph wavelet transform
- Interpolating splines on graphs for data science applications
- Binet-Cauchy kernels on dynamical systems and its application to the analysis of dynamic scenes
- Ideal regularization for learning kernels from labels
- Kernel methods in machine learning
- Kernels, regularization and differential equations
- Probabilistic relaxation labelling using the Fokker-Planck equation
- Towards a theoretical foundation for Laplacian-based manifold methods
- Empirical stationary correlations for semi-supervised learning on graphs
This page was built for publication: Kernels and regularization on graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305847)
