Improving localized multiple kernel learning via radius-margin bound
Summary: Localized multiple kernel learning (LMKL) is an effective method of multiple kernel learning (MKL). It tries to learn the optimal kernel from a set of predefined basic kernels by directly using the maximum margin principle, which is embodied in support vector machine (SVM). However, LMKL does not consider the radius of minimum enclosing ball (MEB) which actually impacts the error bound of SVM as well as the separating margin. In the paper, we propose an improved version of LMKL, which is named ILMKL. The proposed method explicitly takes into consideration both the margin and the radius and so achieves better performance over its counterpart. Moreover, the proposed method can automatically tune the regularization parameter when learning the optimal kernel. Consequently, it avoids using the time-consuming cross-validation process to choose the parameter. Comprehensive experiments are conducted and the results well demonstrate the effectiveness and efficiency of the proposed method.
- Choosing multiple parameters for support vector machines
- Consistency of the group Lasso and multiple kernel learning
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Large scale multiple kernel learning
- Learning the kernel matrix with semidefinite programming
- Localized algorithms for multiple kernel learning
- Multiple kernel learning algorithms
- Radius Margin Bounds for Support Vector Machines with the RBF Kernel
- Regularizing multiple kernel learning using response surface methodology
- SimpleMKL
- Structural multiple empirical kernel learning
- Localized algorithms for multiple kernel learning
- Fast and scalable local kernel machines
- Multiple kernel learning with the generalization error bound of support vector machine
- scientific article; zbMATH DE number 6401257 (Why is no real title available?)
- Multi-kernel learning for multi-label classification with local Rademacher complexity
This page was built for publication: Improving localized multiple kernel learning via radius-margin bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992765)
