Constructing a speculative kernel machine for pattern classification
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- 10.1162/15324430152748236
- 10.1162/jmlr.2003.3.4-5.781
- Algorithm 686: FORTRAN subroutines for updating the QR decomposition
- Greedy function approximation: A gradient boosting machine.
- Kernel matching pursuit
- Matching pursuits with time-frequency dictionaries
- Model Selection and the Principle of Minimum Description Length
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
This page was built for publication: Constructing a speculative kernel machine for pattern classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488681)