Approximations of Time Series
Author(s) -
Muriel Brackstone,
A. S. Deakin
Publication year - 2011
Publication title -
isrn applied mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-5572
pISSN - 2090-5564
DOI - 10.5402/2011/321683
Subject(s) - series (stratigraphy) , collision , mathematics , domain (mathematical analysis) , computer science , algorithm , mathematical analysis , geology , paleontology , computer security
A method is proposed to approximate the main features or patterns including interventions that may occur in a time series. Collisiondata from the Ontario Ministry of Transportation illustrate the approach using monthly collision counts from police reports over a 10-year period from 1990 to 1999. The domain of the time series is partitioned into nonoverlapping subdomains. The major condition on the approximation requires that the series and the approximation have the same average value over each subdomain. To obtain a smooth approximation, based on the second difference of the series, a few iterations are necessary since an iteration over one subdomain is affected by the previous iteration over the adjacent subdomains.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom