Constructing a speculative kernel machine for pattern classification
From MaRDI portal
Publication:2488681
DOI10.1016/j.neunet.2005.06.051zbMath1093.68096WikidataQ47360593 ScholiaQ47360593MaRDI QIDQ2488681
Andy J. Keane, Prasanth B. Nair, Arindam Choudhury
Publication date: 11 May 2006
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2005.06.051
68T10: Pattern recognition, speech recognition
Uses Software
Cites Work
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- 10.1162/15324430152748236
- Algorithm 686: FORTRAN subroutines for updating the QR decomposition
- Model Selection and the Principle of Minimum Description Length
- 10.1162/jmlr.2003.3.4-5.781
- Matching pursuits with time-frequency dictionaries
- Kernel matching pursuit