Sparse conjugate directions pursuit with application to fixed-size kernel models

DOI10.1007/S10994-011-5253-8zbMATH Open1237.68150OpenAlexW2069809382MaRDI QIDQ413891FDOQ413891

Authors: P. Karsmakers, Kristiaan Pelckmans, Hugo Van Hamme, K. De Brabanter, Johan A. K. Suykens 

Publication date: 8 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-011-5253-8

Recommendations

• scientific article
• A sparse least squares support vector machine
• Conjugate gradients for kernel machines
• scientific article; zbMATH DE number 1928693
• scientific article

zbMATH Keywords

sparse approximationkernel methodslinear systemgreedy heuristicmatching pursuit

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• The elements of statistical learning. Data mining, inference, and prediction
• Least angle regression. (With discussion)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Atomic Decomposition by Basis Pursuit
• Title not available (Why is that?)
• A Simplex Method for Function Minimization
• Title not available (Why is that?)
• Compressive sampling
• Title not available (Why is that?)
• Title not available (Why is that?)
• Boosting With theL₂Loss
• A new approach to variable selection in least squares problems
• Methods of conjugate gradients for solving linear systems
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• The Relationship between Variable Selection and Data Agumentation and a Method for Prediction
• Compressed sensing
• Greed is Good: Algorithmic Results for Sparse Approximation
• Sparse Approximate Solutions to Linear Systems
• Clustering to minimize the maximum intercluster distance
• A column generation heuristic for a dynamic generalized assignment problem
• Weighted least squares support vector machines: robustness and sparse approximation
• Optimized fixed-size kernel models for large data sets
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• On simulated annealing and nested annealing.
• Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
• Gradient Pursuits
• Recursive hybrid algorithm for non-linear system identification using radial basis function networks
• Orthogonal least squares methods and their application to non-linear system identification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kernel matching pursuit

Cited In (1)

• Eigen-analysis of nonlinear PCA with polynomial kernels

Uses Software

• SVMlight
• LIBSVM
• PDCO

This page was built for publication: Sparse conjugate directions pursuit with application to fixed-size kernel models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413891)