scientific article; zbMATH DE number 2062634
From MaRDI portal
Publication:4459542
Recommendations
- Intrinsic dimension adaptive partitioning for kernel methods
- Updating kernel methods in spectral decomposition by affinity perturbations
- Algorithms and Computation
- Improved Bounds for the Nyström Method With Application to Kernel Classification
- Spectral partitioning with multiple eigenvectors
- Application of WMD Gaussian kernel in spectral partitioning
- Multi-scale kernels for Nyström based extension schemes
- Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
- Spectral refinement based on superconvergent Nyström and degenerate kernel methods
- Kernel K-Means Sampling for Nyström Approximation
Cited in
(13)- Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images
- An approximate distribution for the normalized cut
- Convergence of the graph Allen-Cahn scheme
- An improved incremental nonlinear dimensionality reduction for isometric data embedding
- Diffuse interface models on graphs for classification of high dimensional data
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- Application of WMD Gaussian kernel in spectral partitioning
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Spectral partitioning with blends of eigenvectors
- Model change active learning in graph-based semi-supervised learning
- Graph Laplacian-based Bayesian multi-fidelity modeling
- A comparison study of graph Laplacian computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459542)
