Using string invariants for prediction searching for optimal parameters
From MaRDI portal
Abstract: We have developed a novel prediction method based on string invariants. The method does not require learning but a small set of parameters must be set to achieve optimal performance. We have implemented an evolutionary algorithm for the parametric optimization. We have tested the performance of the method on artificial and real world data and compared the performance to statistical methods and to a number of artificial intelligence methods. We have used data and the results of a prediction competition as a benchmark. The results show that the method performs well in single step prediction but the methods performance for multiple step prediction needs to be improved. The method works well for a wide range of parameters.
Recommendations
- Local averaging optimization for chaotic time series prediction
- A strategy for computing the parameters of \(k\)-NN
- Prediction method based on optimization theory and its application
- A parametric, information-theory model for predictions in time series
- Method for the prediction of time series using small sets of experimental samples
Cites work
- scientific article; zbMATH DE number 3974816 (Why is no real title available?)
- scientific article; zbMATH DE number 3395169 (Why is no real title available?)
- A First Course in String Theory
- Autoregressive Conditional Heteroscedasticity with Estimates of the Variance of United Kingdom Inflation
- Generalized autoregressive conditional heteroscedasticity
- String Theory
Cited in
(4)
This page was built for publication: Using string invariants for prediction searching for optimal parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1619060)