# Performance

*O*(

*n*

^{2}) and

*O*(

*n*

^{3}) time to solve.” Hand, Mannila and Smyth (2001) “At the time of this writing, empirical evidence suggests that it performs well in many real learning problems.” Hastie, Tibshirani and Friedman (2001) “The problem: if we have

*n*data points, we need

*O*(

*n*

^{2}) memory just to write down the matrix

*D*. If

*n*= 20000, and it takes 4 bytes to represent an entry of

*D*, we would need 1.6 Gigabytes to store the

*D*matrix.” Rifkin “Computing a single kernel product

*K*

^{ij}requires

*O*(

*n*) time, where

*n*is the input dimensionality.” Rifkin

## Bibliography

- CAO, L., 2003. Support vector machines experts for time series forecasting.
*Neurocomputing.*[Cited by 11]