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

DOI10.1007/S10994-011-5253-8MaRDI QIDQ413891zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cites work

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

Cited in

(1)

• Eigen-analysis of nonlinear PCA with polynomial kernels

Describes a project that uses

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)