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

DOI10.1007/s10994-011-5253-8zbMath1237.68150OpenAlexW2069809382MaRDI QIDQ413891

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

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

linear systemkernel methodssparse approximationgreedy 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)

Related Items

Eigen-analysis of nonlinear PCA with polynomial kernels

Uses Software

• SVMlight
• LIBSVM
• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A column generation heuristic for a dynamic generalized assignment problem
• Clustering to minimize the maximum intercluster distance
• On simulated annealing and nested annealing.
• Weighted least squares support vector machines: robustness and sparse approximation
• Least angle regression. (With discussion)
• Optimized fixed-size kernel models for large data sets
• Greed is Good: Algorithmic Results for Sparse Approximation
• 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
• 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
• Atomic Decomposition by Basis Pursuit
• Boosting With theL₂Loss
• A new approach to variable selection in least squares problems
• Gradient Pursuits
• The Relationship between Variable Selection and Data Agumentation and a Method for Prediction
• Sparse Approximate Solutions to Linear Systems
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• A Simplex Method for Function Minimization
• Methods of conjugate gradients for solving linear systems
• Compressed sensing
• The elements of statistical learning. Data mining, inference, and prediction
• Kernel matching pursuit