ON SELECTING MODELS FOR NONLINEAR TIME-SERIES

被引:200
作者
JUDD, K
MEES, A
机构
[1] Mathematics Department, The University of Western Australia, Nedlands
来源
PHYSICA D | 1995年 / 82卷 / 04期
基金
澳大利亚研究理事会;
关键词
D O I
10.1016/0167-2789(95)00050-E
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Constructing models from time series with nontrivial dynamics involves the problem of how to choose the best model from within a class of models, or to choose between competing classes. This paper discusses a method of building nonlinear models of possibly chaotic systems from data, while maintaining good robustness against noise. The models that are built are close to the simplest possible according to a description length criterion. The method will deliver a linear model if that has shorter description length than a nonlinear model. We show how our models can be used for prediction, smoothing and interpolation in the usual way. We also show how to apply the results to identification of chaos by detecting the presence of homoclinic orbits directly from time series.
引用
收藏
页码:426 / 444
页数:19
相关论文
共 25 条
  • [1] ABARBANEL HDI, 1992, LOCAL FALSE NEAREST
  • [2] SINGULAR-VALUE DECOMPOSITION AND THE GRASSBERGER-PROCACCIA ALGORITHM
    ALBANO, AM
    MUENCH, J
    SCHWARTZ, C
    MEES, AI
    RAPP, PE
    [J]. PHYSICAL REVIEW A, 1988, 38 (06): : 3017 - 3026
  • [3] UNIVERSAL APPROXIMATION BOUNDS FOR SUPERPOSITIONS OF A SIGMOIDAL FUNCTION
    BARRON, AR
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) : 930 - 945
  • [4] ORTHOGONAL LEAST-SQUARES LEARNING ALGORITHM FOR RADIAL BASIS FUNCTION NETWORKS
    CHEN, S
    COWAN, CFN
    GRANT, PM
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1991, 2 (02): : 302 - 309
  • [5] Garey M.R., 1979, COMPUTERS INTRACTABI, V174
  • [6] GHADDAR DK, 1981, J ROYAL STAT SOC C, V30, P238
  • [7] GLENDENNING PA, 1983, J STAT PHYS, V35, P645
  • [8] Goldie C. M., 1991, COMMUNICATION THEORY, V20
  • [9] GOLVER J, 1992, J CIRCUITS SYST COMP, V3, P201
  • [10] Kline M., 1972, MATH THOUGHT ANCIENT