Learning low-rank kernel matrices with column-based methods
From MaRDI portal
Recommendations
Cites work
- A NEW METHOD FOR COMPARING EXPERIMENTS AND MEASURING INFORMATION
- Comparison of Efficiency of Stratified and Unequal Probability Sampling
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Performance of Gene Selection and Classification Methods in a Microarray Setting: A Simulation Study
Cited in
(9)- Low-rank decomposition meets kernel learning: a generalized Nyström method
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Low-rank kernel learning with Bregman matrix divergences
- Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
- Block basis factorization for scalable kernel evaluation
- Accurate and fast matrix factorization for low-rank learning.
- Low-rank bilinear classification: efficient convex optimization and extensions
- An efficient kernel matrix evaluation measure
This page was built for publication: Learning low-rank kernel matrices with column-based methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590022)