Multi-class discriminant kernel learning via convex programming
From MaRDI portal
Recommendations
Cited in
(17)- A classifier for multi-dimensional datasets based on Bayesian multiple kernel grouping learning
- Nonparametric discriminant analysis with network structures in predictor
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- Online primal-dual learning for a data-dependent multi-kernel combination model with multiclass visual categorization applications
- A new multi-kernel discriminant analysis
- A trace ratio maximization approach to multiple kernel-based dimensionality reduction
- Discrete kernels, loss functions and parametric models in discrete discrimination: A comparative study
- Consolidation kernel
- Design of a multiple kernel learning algorithm for LS-SVM by convex programming
- Fast prediction with sparse multikernel LS-SVR using multiple relevant time series and its application in avionics system
- Non-sparse multiple kernel Fisher discriminant analysis
- Generalized two-dimensional linear discriminant analysis with regularization
- Learning the optimal kernel for Fisher discriminant analysis via second order cone programming
- A flexible multi-core learning algorithm based on semi-infinite programming
- Class-Discriminative Kernel Sparse Representation-Based Classification Using Multi-Objective Optimization
- Multiview Feature Analysis via Structured Sparsity and Shared Subspace Discovery
This page was built for publication: Multi-class discriminant kernel learning via convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096130)
