Journal of Applied Mathematics and Decision Sciences
Volume 2006 (2006), Article ID 46592, 12 pages

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

Andrew H. Chen,1 Jack H. Penm,2 and R. D. Terrell3

1Edwin L. Cox School of Business, Southern Methodist University, USA
2School of Finance and Applied Statistics, The Australian National University, Canberra, Australia
3National Graduate School of Management, The Australian National University, Canberra, Australia

Received 26 June 2005; Accepted 4 October 2005

Copyright © 2006 Andrew H. Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 Penm et al. (2000) 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.