Online chaotic time series prediction using unbiased composite kernel machine via Cholesky factorization
From MaRDI portal
Publication:989674
DOI10.1007/s00500-009-0479-0zbMath1205.68325OpenAlexW2032209258MaRDI QIDQ989674
Fuchun Sun, Zongtao Zhao, Hongqiao Wang, Yan-Ning Cai
Publication date: 23 August 2010
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-009-0479-0
Cholesky factorizationonline learningkernel methodsleast squares support vector machinechaotic time series predictioncomposite kernel
Related Items
Cites Work
- Multi-kernel regularized classifiers
- Online training of support vector classifier.
- Low rank updated LS-SVM classifiers for fast variable selection
- Advantages of unbiased support vector classifiers for data mining applications
- On the Generalization Ability of On-Line Learning Algorithms
- Accurate On-line Support Vector Regression
- Online Learning with Kernels
- Theory and Applications of Models of Computation
- The relaxed online maximum margin algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Online chaotic time series prediction using unbiased composite kernel machine via Cholesky factorization