The Box-Jenkins approach to time series analysis
We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).
The recursive methods are popular in time series analysis since they are computationally efficient and flexible enough to treat various changes in character of data. This paper gives a survey of the most important type of these methods including their classification and relationships existing among them. Special attention is devoted to i) robustification of some recursive methods, capable of facing outliers in time series, and ii) modifications of recursive methods for time series with missing observations....
This paper applies techniques of Quantile Data Analysis to non-parametrically analyze time series functions such as the sample spectral density, sample correlations and sample partial correlations. The aim is to identify the memory type of an observed time series, and thus to identify parametric time domain models that fit an observed time series. Time series models are usually tested for adequacy by testing if their residuals are white noise. It is proposed that an additional criterion of fit for...