Online sequential prediction for nonstationary time series with new weight-setting strategy using extreme learning machine (Q1665785): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2015/484093 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1514926545 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3658782 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dynamic regularized radial basis function network for nonlinear, nonstationary time series prediction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modified support vector machines in financial time series forecasting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long-term time series prediction using OP-ELM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Relationship between Variable Selection and Data Agumentation and a Method for Prediction / rank | |||
Normal rank |
Latest revision as of 11:51, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Online sequential prediction for nonstationary time series with new weight-setting strategy using extreme learning machine |
scientific article |
Statements
Online sequential prediction for nonstationary time series with new weight-setting strategy using extreme learning machine (English)
0 references
27 August 2018
0 references
Summary: Accurate and fast prediction of nonstationary time series is challenging and of great interest in both practical and academic areas. In this paper, an online sequential extreme learning machine with new weighted strategy is proposed for nonstationary time series prediction. First, a new leave-one-out (LOO) cross-validation error estimation for online sequential data is proposed based on inversion of block matrix. Second, a new weighted strategy based on the proposed LOO error estimation is proposed. This strategy ranks the samples' importance by means of the LOO error of each new added sample and then assigns various weights. Performance comparisons of the proposed method with other existing algorithms are presented based on chaotic and real-world nonstationary time series data. The results show that the proposed method outperforms the classical ELM and OS-ELM in terms of generalization performance and numerical stability.
0 references
0 references