An evolutionary recursive algorithm in selecting statistical subset neural network/VDL filtering (Q2491529)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5028464
Language Label Description Also known as
default for all languages
No label defined
    English
    An evolutionary recursive algorithm in selecting statistical subset neural network/VDL filtering
    scientific article; zbMATH DE number 5028464

      Statements

      An evolutionary recursive algorithm in selecting statistical subset neural network/VDL filtering (English)
      0 references
      0 references
      0 references
      0 references
      29 May 2006
      0 references
      Summary: We propose an evolutionary recursive algorithm, for the exact windowed case, to estimate subset vector discrete lag (SVDL) filters with a forgetting factor and an intercept variable. SVDL filtering is demonstrated as a basis for constructing a multi-layered polynomial neural network by \textit{J. H. W. Penm} et al. [J. Time Ser. Anal. 21, No. 4, 389--412 (2000; Zbl 0974.62073)]. The new proposed time update recursions allow users to update SVDL filters at consecutive time instants, and can show evolutionary changes detected in filter structures. With this new approach we are able to more effectively analyse complex relationships where the relevant financial time series have been generated from structures subject to evolutionary changes in their environment. An illustration of these procedures is presented to examine the integration between the Australian and the Japanese bond markets, and the USA and the UK bond markets, changed over the period. The proposed algorithms are also applicable to full-order vector discrete lag (VDL) filtering with a forgetting factor and an intercept.
      0 references

      Identifiers