• DocumentCode
    1817097
  • Title

    Measures of serial data compressibility by neural network predictors

  • Author

    Coughlin, James P. ; Baran, R.H. ; Ko, Hanseok

  • Author_Institution
    Dept. of Maths., Towson State Univ., MD, USA
  • Volume
    1
  • fYear
    1992
  • fDate
    7-11 Jun 1992
  • Firstpage
    755
  • Abstract
    A time series or univariate random process is compressible if it is predictable. Experiments with a variety of processes readily show that adaptive neural networks are at least as effective as their linear counterparts in one-step-ahead prediction. The relationship between the predictive accuracy attained by the network, in the long run, and the closeness with which it can fit (and overfit) small segments of the same series in the course of many passes through the same data is examined. The findings suggest that the predictability of a process can be estimated by measuring the ease with which its increments can be overfitted
  • Keywords
    learning (artificial intelligence); neural nets; random processes; adaptive neural networks; neural network predictors; one-step-ahead prediction; predictive accuracy; serial data compressibility; time series; univariate random process; Accuracy; Adaptive systems; Data compression; Decoding; Encoding; Geophysics computing; Mathematics; Neural networks; Pixel; Random processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1992. IJCNN., International Joint Conference on
  • Conference_Location
    Baltimore, MD
  • Print_ISBN
    0-7803-0559-0
  • Type

    conf

  • DOI
    10.1109/IJCNN.1992.287096
  • Filename
    287096