Efficient learning of supervised kernels with a graph-based loss function
From MaRDI portal
Publication:2282120
DOI10.1016/j.ins.2016.07.064zbMath1428.68250OpenAlexW2490781471MaRDI QIDQ2282120
Chen Xu, Binbin Pan, Wen-Sheng Chen, Bo Chen
Publication date: 6 January 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2016.07.064
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kernel self-optimization learning for kernel-based feature extraction and recognition
- A new polynomial-time algorithm for linear programming
- Ideal regularization for learning kernels from labels
- Fast Gaussian kernel learning for classification tasks based on specially structured global optimization
- Theory of linear ill-posed problems and its applications. Transl., updated and revised from the Russian edition 1978
- Online primal-dual learning for a data-dependent multi-kernel combination model with multiclass visual categorization applications
- An efficient Gaussian kernel optimization based on centered kernel polarization criterion
- Principal component analysis.
- Kernel learning at the first level of inference
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Theory and Kernel Machines
This page was built for publication: Efficient learning of supervised kernels with a graph-based loss function