Abstract
A novel critical vector (CV) regression algorithm is proposed in the paper based on our previous work and PRESS statistics. The proposed regularized CV algorithm finds critical vectors in a successive greedy process in which, compared to the classical OLS algorithm, the orthogonalization has been removed from the algorithm. The performance of the proposed algorithm is comparable to the OLS algorithm while it saves a lot of time complexities in implementing orthogonalization needed in the OLS algorithm.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 2004 International Conference On Machine Learning and Cybernetics |
| Editors | Yeung, D S |
| Place of Publication | Los Alamitos, United States of America |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 3223-3228 |
| Volume | Volume 5, 26-29 Aug |
| ISBN (Print) | 0780384032 |
| DOIs | |
| Publication status | Published - 2004 |
| Event | ICMLC 2004: 2004 International Conference on Machine Learning and Cybernetics - Shanghai, China Duration: 26 Aug 2004 → 29 Aug 2004 |
Conference
| Conference | ICMLC 2004: 2004 International Conference on Machine Learning and Cybernetics |
|---|---|
| City | Shanghai, China |
| Period | 26/08/04 → 29/08/04 |
Keywords
- Simulation and Modelling
Fingerprint
Dive into the research topics of 'Critical Vector Learning to Construct Sparse Kernel Modeling with PRESS Statistic'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver