Multivariate time series online prediction based on adaptive normalized sparse kernel recursive least squares algorithm

As a kind of kernel methods, kernel recursive least squares has attracted wide attention in the research of time series online prediction. It has low computational complexity and updates in the shape of recursive increment. However, with the increase of data size, computational complexity of calcula...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2017 Seventh International Conference on Information Science and Technology (ICIST) s. 38 - 44
Hlavní autoři: Shuhui Zhang, Min Han, Jun Wang, Dan Wang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2017
Témata:
adaptive
Coherence
Computational complexity
Decision support systems
Heuristic algorithms
Kernel
kernel recursive least squares
Shape
Time series analysis
time series online prediction
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract As a kind of kernel methods, kernel recursive least squares has attracted wide attention in the research of time series online prediction. It has low computational complexity and updates in the shape of recursive increment. However, with the increase of data size, computational complexity of calculating kernel inverse matrix will raise. In addition, in the process of online prediction, it cannot accommodate dynamic environment commendably. It is difficult to meet the demand of prediction accuracy and efficiency simultaneously. Therefore, this paper presents an improved kernel recursive least squares algorithm for multivariate chaotic time series online prediction. We apply dynamic adjustment and coherence criterions to propose adaptive normalized sparse kernel recursive least squares (ANS-KRLS) method. In our method, the size of kernel matrix can be reduced, so that computational complexity drops. And ANS-KRLS has the ability to operate online and adjust weights adaptively in time-varying environments. The proposed method has been simulated on Lorenz time series and ENSO related indexes time series. Simulation results prove that ANS-KRLS performs well on prediction accuracy and efficiency.
AbstractList As a kind of kernel methods, kernel recursive least squares has attracted wide attention in the research of time series online prediction. It has low computational complexity and updates in the shape of recursive increment. However, with the increase of data size, computational complexity of calculating kernel inverse matrix will raise. In addition, in the process of online prediction, it cannot accommodate dynamic environment commendably. It is difficult to meet the demand of prediction accuracy and efficiency simultaneously. Therefore, this paper presents an improved kernel recursive least squares algorithm for multivariate chaotic time series online prediction. We apply dynamic adjustment and coherence criterions to propose adaptive normalized sparse kernel recursive least squares (ANS-KRLS) method. In our method, the size of kernel matrix can be reduced, so that computational complexity drops. And ANS-KRLS has the ability to operate online and adjust weights adaptively in time-varying environments. The proposed method has been simulated on Lorenz time series and ENSO related indexes time series. Simulation results prove that ANS-KRLS performs well on prediction accuracy and efficiency.
Author Jun Wang
Min Han
Shuhui Zhang
Dan Wang
Author_xml – sequence: 1
  surname: Shuhui Zhang
  fullname: Shuhui Zhang
  organization: Fac. of Electron. Inf. & Electr. Eng., Dalian Univ. of Technol., Dalian, China
– sequence: 2
  surname: Min Han
  fullname: Min Han
  email: minhan@dlut.edu.cn
  organization: Fac. of Electron. Inf. & Electr. Eng., Dalian Univ. of Technol., Dalian, China
– sequence: 3
  surname: Jun Wang
  fullname: Jun Wang
  organization: Fac. of Electron. Inf. & Electr. Eng., Dalian Univ. of Technol., Dalian, China
– sequence: 4
  surname: Dan Wang
  fullname: Dan Wang
  organization: Marine Eng. Coll., Dalian Maritime Univ., Dalian, China
BookMark eNotkMtOwzAURI0EC1r4Adj4B1p883DsJYp4VCpiQffVjX0DFo4TbBcEX08QXY10NHMWs2CnYQzE2BWINYDQN5t287JbFwKadaMLqURzwhZQCy3qSkB1zr6eDj67T4wOM_HsBuKJoqPEx-BdID5Fss5kNwbeYSI7c44Wp3lEPIxxQO9-ZpwmjIn4O8VAnkcyh5j-Kp4wZZ4-DhhnKfrXMbr8Nlywsx59ostjLtnu_m7XPq62zw-b9na7clrkVa-UUZKkUFJLQNNIC9joztqi6Y0waDpQqEtDFZSABNL0Utm6KipLUFC5ZNf_WkdE-ym6AeP3_nhF-QvJelyt
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICIST.2017.7926807
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1509054014
9781509054015
EndPage 44
ExternalDocumentID 7926807
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-f88c86e6086961ac76d1a79bdd27fc0cacb18a93ce4131ae16cf68d5424de12e3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:37:58 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-f88c86e6086961ac76d1a79bdd27fc0cacb18a93ce4131ae16cf68d5424de12e3
PageCount 7
ParticipantIDs ieee_primary_7926807
PublicationCentury 2000
PublicationDate 2017-April
PublicationDateYYYYMMDD 2017-04-01
PublicationDate_xml – month: 04
  year: 2017
  text: 2017-April
PublicationDecade 2010
PublicationTitle 2017 Seventh International Conference on Information Science and Technology (ICIST)
PublicationTitleAbbrev ICIST
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.641079
Snippet As a kind of kernel methods, kernel recursive least squares has attracted wide attention in the research of time series online prediction. It has low...
SourceID ieee
SourceType Publisher
StartPage 38
SubjectTerms adaptive
Coherence
Computational complexity
Decision support systems
Heuristic algorithms
Kernel
kernel recursive least squares
Shape
Time series analysis
time series online prediction
Title Multivariate time series online prediction based on adaptive normalized sparse kernel recursive least squares algorithm
URI https://ieeexplore.ieee.org/document/7926807
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61ePCk0opvcvDotvvM41wsFqQULNJbySYTXazburut4K83s1srghdvYQgEZsK8vxlCboTiUvgm8tzfjb2YJcqTCVdeGrAErDF-WpcLnh74eCxmMzlpkdsdFgYA6uYz6OGxruWbpV5jqqzPZcgEQsf3OGcNVusbB-PL_mgwepxisxbvbS_-2phSG4zh4f-eOiLdH-QdnexsyjFpQd4hHzVKduOiWucYUtwGT_HjQEmbORd0VWC5BVlM0SoZR6fKqBWqMpqjV7rIPh3ZaY-iBPoKRQ4LWmCqHbvX6QIX-NDyfY1gJKoWz8siq17eumQ6vJsO7r3twgQvk37lWSG0YMBclCJZoDRnJnCiSI0JudW-VjoNhJKRBme5AgUB05YJk8RhbCAIIToh7XyZwymh1koTGalDk4o44VY5ZRRIFYc8VDq25ox0kGfzVTMSY75l1_nf5AtygGJpGl4uSbsq1nBF9vWmysriupbjFzNPpZU
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lCnpSacW3OXh0291tNo9zsbRYS8FFeivZZFaLdVu3D8Ffb2a3VgQv3sIQCMyEeX8zhNxILZT0bctzf5d5jEfaU5HQXhLwCFJr_aQoFzz1xWAgRyM1rJDbLRYGAIrmM2jgsajl25lZYaqsKVTIJULHdyLGQr9Ea30jYXzV7LV7jzG2a4nG5uqvnSmFyegc_O-xQ1L_wd7R4daqHJEKZDXyUeBk1y6uda4hxX3wFL8OLGg56YLOcyy4IJMp2iXr6FRbPUdlRjP0S6eTT0d2-iNfAH2FPIMpzTHZjv3rdIorfOjifYVwJKqnz7N8snx5q5O4cxe3u95mZYI3Uf7SS6U0kgN3cYrigTaC28AJI7E2FKnxjTZJILVqGXC2K9AQcJNyaSMWMgtBCK1jUs1mGZwQmqbKtqwyoU0ki0SqnToKlGahCLVhqT0lNeTZeF4OxRhv2HX2N_ma7HXjh_643xvcn5N9FFHZ_nJBqst8BZdk16yXk0V-Vcj0C_YFqNw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2017+Seventh+International+Conference+on+Information+Science+and+Technology+%28ICIST%29&rft.atitle=Multivariate+time+series+online+prediction+based+on+adaptive+normalized+sparse+kernel+recursive+least+squares+algorithm&rft.au=Shuhui+Zhang&rft.au=Min+Han&rft.au=Jun+Wang&rft.au=Dan+Wang&rft.date=2017-04-01&rft.pub=IEEE&rft.spage=38&rft.epage=44&rft_id=info:doi/10.1109%2FICIST.2017.7926807&rft.externalDocID=7926807