Time series

Last updated

Time series: random data plus trend, with best-fit line and different applied filters Random-data-plus-trend-r2.png
Time series: random data plus trend, with best-fit line and different applied filters

In mathematics, a time series is a series of data points indexed (or listed or graphed) in time order. Most commonly, a time series is a sequence taken at successive equally spaced points in time. Thus it is a sequence of discrete-time data. Examples of time series are heights of ocean tides, counts of sunspots, and the daily closing value of the Dow Jones Industrial Average.

Contents

A time series is very frequently plotted via a run chart (which is a temporal line chart). Time series are used in statistics, signal processing, pattern recognition, econometrics, mathematical finance, weather forecasting, earthquake prediction, electroencephalography, control engineering, astronomy, communications engineering, and largely in any domain of applied science and engineering which involves temporal measurements.

Time series analysis comprises methods for analyzing time series data in order to extract meaningful statistics and other characteristics of the data. Time series forecasting is the use of a model to predict future values based on previously observed values. Generally, time series data is modelled as a stochastic process. While regression analysis is often employed in such a way as to test relationships between one or more different time series, this type of analysis is not usually called "time series analysis", which refers in particular to relationships between different points in time within a single series.

Time series data have a natural temporal ordering. This makes time series analysis distinct from cross-sectional studies, in which there is no natural ordering of the observations (e.g. explaining people's wages by reference to their respective education levels, where the individuals' data could be entered in any order). Time series analysis is also distinct from spatial data analysis where the observations typically relate to geographical locations (e.g. accounting for house prices by the location as well as the intrinsic characteristics of the houses). A stochastic model for a time series will generally reflect the fact that observations close together in time will be more closely related than observations further apart. In addition, time series models will often make use of the natural one-way ordering of time so that values for a given period will be expressed as deriving in some way from past values, rather than from future values (see time reversibility).

Time series analysis can be applied to real-valued, continuous data, discrete numeric data, or discrete symbolic data (i.e. sequences of characters, such as letters and words in the English language [1] ).

Methods for analysis

Methods for time series analysis may be divided into two classes: frequency-domain methods and time-domain methods. The former include spectral analysis and wavelet analysis; the latter include auto-correlation and cross-correlation analysis. In the time domain, correlation and analysis can be made in a filter-like manner using scaled correlation, thereby mitigating the need to operate in the frequency domain.

Additionally, time series analysis techniques may be divided into parametric and non-parametric methods. The parametric approaches assume that the underlying stationary stochastic process has a certain structure which can be described using a small number of parameters (for example, using an autoregressive or moving-average model). In these approaches, the task is to estimate the parameters of the model that describes the stochastic process. By contrast, non-parametric approaches explicitly estimate the covariance or the spectrum of the process without assuming that the process has any particular structure.

Methods of time series analysis may also be divided into linear and non-linear, and univariate and multivariate.

Panel data

A time series is one type of panel data. Panel data is the general class, a multidimensional data set, whereas a time series data set is a one-dimensional panel (as is a cross-sectional dataset). A data set may exhibit characteristics of both panel data and time series data. One way to tell is to ask what makes one data record unique from the other records. If the answer is the time data field, then this is a time series data set candidate. If determining a unique record requires a time data field and an additional identifier which is unrelated to time (e.g. student ID, stock symbol, country code), then it is panel data candidate. If the differentiation lies on the non-time identifier, then the data set is a cross-sectional data set candidate.

Analysis

There are several types of motivation and data analysis available for time series which are appropriate for different purposes.

Motivation

In the context of statistics, econometrics, quantitative finance, seismology, meteorology, and geophysics the primary goal of time series analysis is forecasting. In the context of signal processing, control engineering and communication engineering it is used for signal detection. Other applications are in data mining, pattern recognition and machine learning, where time series analysis can be used for clustering, [2] [3] classification, [4] query by content, [5] anomaly detection as well as forecasting. [6]

Exploratory analysis

Time series of tuberculosis deaths in the United States 1954-2021. Time series TB US.png
Time series of tuberculosis deaths in the United States 1954-2021.

A simple way to examine a regular time series is manually with a line chart. The datagraphic shows tuberculosis deaths in the United States, [7] along with the yearly change and the percentage change from year to year. The total number of deaths declined in every year until the mid-1980s, after which there were occasional increases, often proportionately - but not absolutely - quite large.

A study of corporate data analysts found two challenges to exploratory time series analysis: discovering the shape of interesting patterns, and finding an explanation for these patterns. [8] Visual tools that represent time series data as heat map matrices can help overcome these challenges.

Other techniques include:

Curve fitting

Curve fitting [11] [12] is the process of constructing a curve, or mathematical function, that has the best fit to a series of data points, [13] possibly subject to constraints. [14] [15] Curve fitting can involve either interpolation, [16] [17] where an exact fit to the data is required, or smoothing, [18] [19] in which a "smooth" function is constructed that approximately fits the data. A related topic is regression analysis, [20] [21] which focuses more on questions of statistical inference such as how much uncertainty is present in a curve that is fit to data observed with random errors. Fitted curves can be used as an aid for data visualization, [22] [23] to infer values of a function where no data are available, [24] and to summarize the relationships among two or more variables. [25] Extrapolation refers to the use of a fitted curve beyond the range of the observed data, [26] and is subject to a degree of uncertainty [27] since it may reflect the method used to construct the curve as much as it reflects the observed data.

Growth equations Growth equations.png
Growth equations

For processes that are expected to generally grow in magnitude one of the curves in the graphic (and many others) can be fitted by estimating their parameters.

The construction of economic time series involves the estimation of some components for some dates by interpolation between values ("benchmarks") for earlier and later dates. Interpolation is estimation of an unknown quantity between two known quantities (historical data), or drawing conclusions about missing information from the available information ("reading between the lines"). [28] Interpolation is useful where the data surrounding the missing data is available and its trend, seasonality, and longer-term cycles are known. This is often done by using a related series known for all relevant dates. [29] Alternatively polynomial interpolation or spline interpolation is used where piecewise polynomial functions are fitted in time intervals such that they fit smoothly together. A different problem which is closely related to interpolation is the approximation of a complicated function by a simple function (also called regression). The main difference between regression and interpolation is that polynomial regression gives a single polynomial that models the entire data set. Spline interpolation, however, yield a piecewise continuous function composed of many polynomials to model the data set.

Extrapolation is the process of estimating, beyond the original observation range, the value of a variable on the basis of its relationship with another variable. It is similar to interpolation, which produces estimates between known observations, but extrapolation is subject to greater uncertainty and a higher risk of producing meaningless results.

Function approximation

In general, a function approximation problem asks us to select a function among a well-defined class that closely matches ("approximates") a target function in a task-specific way. One can distinguish two major classes of function approximation problems: First, for known target functions, approximation theory is the branch of numerical analysis that investigates how certain known functions (for example, special functions) can be approximated by a specific class of functions (for example, polynomials or rational functions) that often have desirable properties (inexpensive computation, continuity, integral and limit values, etc.).

Second, the target function, call it g, may be unknown; instead of an explicit formula, only a set of points (a time series) of the form (x, g(x)) is provided. Depending on the structure of the domain and codomain of g, several techniques for approximating g may be applicable. For example, if g is an operation on the real numbers, techniques of interpolation, extrapolation, regression analysis, and curve fitting can be used. If the codomain (range or target set) of g is a finite set, one is dealing with a classification problem instead. A related problem of online time series approximation [30] is to summarize the data in one-pass and construct an approximate representation that can support a variety of time series queries with bounds on worst-case error.

To some extent, the different problems (regression, classification, fitness approximation) have received a unified treatment in statistical learning theory, where they are viewed as supervised learning problems.

Prediction and forecasting

In statistics, prediction is a part of statistical inference. One particular approach to such inference is known as predictive inference, but the prediction can be undertaken within any of the several approaches to statistical inference. Indeed, one description of statistics is that it provides a means of transferring knowledge about a sample of a population to the whole population, and to other related populations, which is not necessarily the same as prediction over time. When information is transferred across time, often to specific points in time, the process is known as forecasting.

Classification

Assigning time series pattern to a specific category, for example identify a word based on series of hand movements in sign language.

Signal estimation

This approach is based on harmonic analysis and filtering of signals in the frequency domain using the Fourier transform, and spectral density estimation, the development of which was significantly accelerated during World War II by mathematician Norbert Wiener, electrical engineers Rudolf E. Kálmán, Dennis Gabor and others for filtering signals from noise and predicting signal values at a certain point in time. See Kalman filter, Estimation theory, and Digital signal processing

Segmentation

Splitting a time-series into a sequence of segments. It is often the case that a time-series can be represented as a sequence of individual segments, each with its own characteristic properties. For example, the audio signal from a conference call can be partitioned into pieces corresponding to the times during which each person was speaking. In time-series segmentation, the goal is to identify the segment boundary points in the time-series, and to characterize the dynamical properties associated with each segment. One can approach this problem using change-point detection, or by modeling the time-series as a more sophisticated system, such as a Markov jump linear system.

Clustering

Time series data may be clustered, however special care has to be taken when considering subsequence clustering. [32] Time series clustering may be split into

Subsequence time series clustering

Subsequence time series clustering resulted in unstable (random) clusters induced by the feature extraction using chunking with sliding windows. [33] It was found that the cluster centers (the average of the time series in a cluster - also a time series) follow an arbitrarily shifted sine pattern (regardless of the dataset, even on realizations of a random walk). This means that the found cluster centers are non-descriptive for the dataset because the cluster centers are always nonrepresentative sine waves.

Models

Models for time series data can have many forms and represent different stochastic processes. When modeling variations in the level of a process, three broad classes of practical importance are the autoregressive (AR) models, the integrated (I) models, and the moving-average (MA) models. These three classes depend linearly on previous data points. [34] Combinations of these ideas produce autoregressive moving-average (ARMA) and autoregressive integrated moving-average (ARIMA) models. The autoregressive fractionally integrated moving-average (ARFIMA) model generalizes the former three. Extensions of these classes to deal with vector-valued data are available under the heading of multivariate time-series models and sometimes the preceding acronyms are extended by including an initial "V" for "vector", as in VAR for vector autoregression. An additional set of extensions of these models is available for use where the observed time-series is driven by some "forcing" time-series (which may not have a causal effect on the observed series): the distinction from the multivariate case is that the forcing series may be deterministic or under the experimenter's control. For these models, the acronyms are extended with a final "X" for "exogenous".

Non-linear dependence of the level of a series on previous data points is of interest, partly because of the possibility of producing a chaotic time series. However, more importantly, empirical investigations can indicate the advantage of using predictions derived from non-linear models, over those from linear models, as for example in nonlinear autoregressive exogenous models. Further references on nonlinear time series analysis: (Kantz and Schreiber), [35] and (Abarbanel) [36]

Among other types of non-linear time series models, there are models to represent the changes of variance over time (heteroskedasticity). These models represent autoregressive conditional heteroskedasticity (ARCH) and the collection comprises a wide variety of representation (GARCH, TARCH, EGARCH, FIGARCH, CGARCH, etc.). Here changes in variability are related to, or predicted by, recent past values of the observed series. This is in contrast to other possible representations of locally varying variability, where the variability might be modelled as being driven by a separate time-varying process, as in a doubly stochastic model.

In recent work on model-free analyses, wavelet transform based methods (for example locally stationary wavelets and wavelet decomposed neural networks) have gained favor. [37] Multiscale (often referred to as multiresolution) techniques decompose a given time series, attempting to illustrate time dependence at multiple scales. See also Markov switching multifractal (MSMF) techniques for modeling volatility evolution.

A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process with unobserved (hidden) states. An HMM can be considered as the simplest dynamic Bayesian network. HMM models are widely used in speech recognition, for translating a time series of spoken words into text.

Many of these models are collected in the python package sktime.

Notation

A number of different notations are in use for time-series analysis. A common notation specifying a time series X that is indexed by the natural numbers is written

X = (X1, X2, ...).

Another common notation is

Y = (Yt: t ∈ T),

where T is the index set.

Conditions

There are two sets of conditions under which much of the theory is built:

Ergodicity implies stationarity, but the converse is not necessarily the case. Stationarity is usually classified into strict stationarity and wide-sense or second-order stationarity. Both models and applications can be developed under each of these conditions, although the models in the latter case might be considered as only partly specified.

In addition, time-series analysis can be applied where the series are seasonally stationary or non-stationary. Situations where the amplitudes of frequency components change with time can be dealt with in time-frequency analysis which makes use of a time–frequency representation of a time-series or signal. [38]

Tools

Tools for investigating time-series data include:

Measures

Time-series metrics or features that can be used for time series classification or regression analysis: [41]

Visualization

Time series can be visualized with two categories of chart: Overlapping Charts and Separated Charts. Overlapping Charts display all-time series on the same layout while Separated Charts presents them on different layouts (but aligned for comparison purpose) [45]

Overlapping charts

Separated charts

See also

Related Research Articles

<span class="mw-page-title-main">Autocorrelation</span> Correlation of a signal with a time-shifted copy of itself, as a function of shift

Autocorrelation, sometimes known as serial correlation in the discrete time case, is the correlation of a signal with a delayed copy of itself as a function of delay. Informally, it is the similarity between observations of a random variable as a function of the time lag between them. The analysis of autocorrelation is a mathematical tool for finding repeating patterns, such as the presence of a periodic signal obscured by noise, or identifying the missing fundamental frequency in a signal implied by its harmonic frequencies. It is often used in signal processing for analyzing functions or series of values, such as time domain signals.

In the statistical analysis of time series, autoregressive–moving-average (ARMA) models are a way to describe of a (weakly) stationary stochastic process using autoregression (AR) and a moving average (MA), each with a polynomial. They are a tool for understanding a series and predicting future values. AR involves regressing the variable on its own lagged (i.e., past) values. MA involves modeling the error as a linear combination of error terms occurring contemporaneously and at various times in the past. The model is usually denoted ARMA(p, q), where p is the order of AR and q is the order of MA.

<span class="mw-page-title-main">Regression analysis</span> Set of statistical processes for estimating the relationships among variables

In statistical modeling, regression analysis is a set of statistical processes for estimating the relationships between a dependent variable and one or more error-free independent variables. The most common form of regression analysis is linear regression, in which one finds the line that most closely fits the data according to a specific mathematical criterion. For example, the method of ordinary least squares computes the unique line that minimizes the sum of squared differences between the true data and that line. For specific mathematical reasons, this allows the researcher to estimate the conditional expectation of the dependent variable when the independent variables take on a given set of values. Less common forms of regression use slightly different procedures to estimate alternative location parameters or estimate the conditional expectation across a broader collection of non-linear models.

In statistics, econometrics, and signal processing, an autoregressive (AR) model is a representation of a type of random process; as such, it can be used to describe certain time-varying processes in nature, economics, behavior, etc. The autoregressive model specifies that the output variable depends linearly on its own previous values and on a stochastic term ; thus the model is in the form of a stochastic difference equation which should not be confused with a differential equation. Together with the moving-average (MA) model, it is a special case and key component of the more general autoregressive–moving-average (ARMA) and autoregressive integrated moving average (ARIMA) models of time series, which have a more complicated stochastic structure; it is also a special case of the vector autoregressive model (VAR), which consists of a system of more than one interlocking stochastic difference equation in more than one evolving random variable.

In time series analysis used in statistics and econometrics, autoregressive integrated moving average (ARIMA) and seasonal ARIMA (SARIMA) models are generalizations of the autoregressive moving average (ARMA) model to non-stationary series and periodic variation, respectively. All these models are fitted to time series in order to better understand it and predict future values. The purpose of these generalizations is to fit the data as well as possible. Specifically, ARMA assumes that the series is stationary, that is, its expected value is constant in time. If instead the series has a trend, the trend is removed by "differencing", leaving a stationary series. This operation generalizes ARMA and corresponds to the "integrated" part of ARIMA. Analogously, periodic variation is removed by "seasonal differencing".

<span class="mw-page-title-main">Granger causality</span> Statistical hypothesis test for forecasting

The Granger causality test is a statistical hypothesis test for determining whether one time series is useful in forecasting another, first proposed in 1969. Ordinarily, regressions reflect "mere" correlations, but Clive Granger argued that causality in economics could be tested for by measuring the ability to predict the future values of a time series using prior values of another time series. Since the question of "true causality" is deeply philosophical, and because of the post hoc ergo propter hoc fallacy of assuming that one thing preceding another can be used as a proof of causation, econometricians assert that the Granger test finds only "predictive causality". Using the term "causality" alone is a misnomer, as Granger-causality is better described as "precedence", or, as Granger himself later claimed in 1977, "temporally related". Rather than testing whether Xcauses Y, the Granger causality tests whether X forecastsY.

Functional data analysis (FDA) is a branch of statistics that analyses data providing information about curves, surfaces or anything else varying over a continuum. In its most general form, under an FDA framework, each sample element of functional data is considered to be a random function. The physical continuum over which these functions are defined is often time, but may also be spatial location, wavelength, probability, etc. Intrinsically, functional data are infinite dimensional. The high intrinsic dimensionality of these data brings challenges for theory as well as computation, where these challenges vary with how the functional data were sampled. However, the high or infinite dimensional structure of the data is a rich source of information and there are many interesting challenges for research and data analysis.

RATS, an abbreviation of Regression Analysis of Time Series, is a statistical package for time series analysis and econometrics. RATS is developed and sold by Estima, Inc., located in Evanston, IL.

Maximum entropy spectral estimation is a method of spectral density estimation. The goal is to improve the spectral quality based on the principle of maximum entropy. The method is based on choosing the spectrum which corresponds to the most random or the most unpredictable time series whose autocorrelation function agrees with the known values. This assumption, which corresponds to the concept of maximum entropy as used in both statistical mechanics and information theory, is maximally non-committal with regard to the unknown values of the autocorrelation function of the time series. It is simply the application of maximum entropy modeling to any type of spectrum and is used in all fields where data is presented in spectral form. The usefulness of the technique varies based on the source of the spectral data since it is dependent on the amount of assumed knowledge about the spectrum that can be applied to the model.

In statistical signal processing, the goal of spectral density estimation (SDE) or simply spectral estimation is to estimate the spectral density of a signal from a sequence of time samples of the signal. Intuitively speaking, the spectral density characterizes the frequency content of the signal. One purpose of estimating the spectral density is to detect any periodicities in the data, by observing peaks at the frequencies corresponding to these periodicities.

<span class="mw-page-title-main">Partial autocorrelation function</span> Partial correlation of a time series with its lagged values

In time series analysis, the partial autocorrelation function (PACF) gives the partial correlation of a stationary time series with its own lagged values, regressed the values of the time series at all shorter lags. It contrasts with the autocorrelation function, which does not control for other lags.

In time series analysis, the moving-average model, also known as moving-average process, is a common approach for modeling univariate time series. The moving-average model specifies that the output variable is cross-correlated with a non-identical to itself random-variable.

In probability theory, a Markov model is a stochastic model used to model pseudo-randomly changing systems. It is assumed that future states depend only on the current state, not on the events that occurred before it. Generally, this assumption enables reasoning and computation with the model that would otherwise be intractable. For this reason, in the fields of predictive modelling and probabilistic forecasting, it is desirable for a given model to exhibit the Markov property.

The following outline is provided as an overview of and topical guide to regression analysis:

Design of robust and reliable networks and network services relies on an understanding of the traffic characteristics of the network. Throughout history, different models of network traffic have been developed and used for evaluating existing and proposed networks and services.

The following outline is provided as an overview of and topical guide to machine learning:

References

  1. ↑ Lin, Jessica; Keogh, Eamonn; Lonardi, Stefano; Chiu, Bill (2003). "A symbolic representation of time series, with implications for streaming algorithms". Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery. New York: ACM Press. pp. 2–11. CiteSeerX   10.1.1.14.5597 . doi:10.1145/882082.882086. ISBN   9781450374224. S2CID   6084733.
  2. ↑ Warren Liao, T. (November 2005). "Clustering of time series data—a survey". Pattern Recognition. 38 (11): 1857–1874. Bibcode:2005PatRe..38.1857W. doi:10.1016/j.patcog.2005.01.025. S2CID   8973749.
  3. ↑ Aghabozorgi, Saeed; Seyed Shirkhorshidi, Ali; Ying Wah, Teh (October 2015). "Time-series clustering – A decade review". Information Systems. 53: 16–38. doi:10.1016/j.is.2015.04.007. S2CID   158707.
  4. ↑ Keogh, Eamonn; Kasetty, Shruti (2002). "On the need for time series data mining benchmarks: A survey and empirical demonstration". Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. pp. 102–111. doi:10.1145/775047.775062. ISBN   1-58113-567-X.
  5. ↑ Agrawal, Rakesh; Faloutsos, Christos; Swami, Arun (1993). "Efficient similarity search in sequence databases". Foundations of Data Organization and Algorithms. Lecture Notes in Computer Science. Vol. 730. pp. 69–84. doi:10.1007/3-540-57301-1_5. ISBN   978-3-540-57301-2. S2CID   16748451.
  6. ↑ Chen, Cathy W. S.; Chiu, L. M. (4 September 2021). "Ordinal Time Series Forecasting of the Air Quality Index". Entropy. 23 (9): 1167. Bibcode:2021Entrp..23.1167C. doi: 10.3390/e23091167 . PMC   8469594 . PMID   34573792.
  7. ↑ www.cdc.gov/tb/statistics/reports/2022/table1.htm
  8. ↑ Sarkar, Advait; Spott, Martin; Blackwell, Alan F.; Jamnik, Mateja (2016). "Visual discovery and model-driven explanation of time series patterns". 2016 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC). pp. 78–86. doi:10.1109/vlhcc.2016.7739668. ISBN   978-1-5090-0252-8. S2CID   9787931.
  9. ↑ Bloomfield, Peter (1976). Fourier Analysis of Time Series: An Introduction. Wiley. ISBN   978-0-471-08256-9.[ page needed ]
  10. ↑ Shumway, Robert H. (1988). Applied Statistical Time Series Analysis. Prentice-Hall. ISBN   978-0-13-041500-4.[ page needed ]
  11. ↑ Arlinghaus, Sandra (1994). Practical Handbook of Curve Fitting. CRC Press. ISBN   978-0-8493-0143-8.[ page needed ]
  12. ↑ Kolb, William M. (1984). Curve Fitting for Programmable Calculators. SYNTEC. ISBN   978-0-943494-02-9.[ page needed ]
  13. ↑ Halli, S. S.; Rao, K. V. (1992). Advanced Techniques of Population Analysis. Springer Science & Business Media. p. 165. ISBN   978-0-306-43997-1. functions are fulfilled if we have a good to moderate fit for the observed data.
  14. ↑ The Signal and the Noise: Why So Many Predictions Fail-but Some Don't. By Nate Silver
  15. ↑ Pyle, Dorian (1999). Data Preparation for Data Mining. Morgan Kaufmann. ISBN   978-1-55860-529-9.[ page needed ]
  16. ↑ Numerical Methods in Engineering with MATLAB®. By Jaan Kiusalaas. Page 24.
  17. ↑ Kiusalaas, Jaan (2013). Numerical Methods in Engineering with Python 3. Cambridge University Press. p. 21. ISBN   978-1-139-62058-1.
  18. ↑ Guest, Philip George (2012). Numerical Methods of Curve Fitting. Cambridge University Press. p. 349. ISBN   978-1-107-64695-7.
  19. ↑ See also: Mollifier
  20. ↑ Motulsky, Harvey; Christopoulos, Arthur (2004). Fitting Models to Biological Data Using Linear and Nonlinear Regression: A Practical Guide to Curve Fitting. Oxford University Press. ISBN   978-0-19-803834-4.[ page needed ]
  21. ↑ Regression Analysis By Rudolf J. Freund, William J. Wilson, Ping Sa. Page 269.[ date missing ]
  22. ↑ Daud, Hanita; Sagayan, Vijanth; Yahya, Noorhana; Najwati, Wan (2009). "Modeling of Electromagnetic Waves Using Statistical and Numerical Techniques". Visual Informatics: Bridging Research and Practice. Lecture Notes in Computer Science. Vol. 5857. pp. 686–695. doi:10.1007/978-3-642-05036-7_65. ISBN   978-3-642-05035-0.
  23. ↑ Hauser, John R. (2009). Numerical Methods for Nonlinear Engineering Models. Springer Science & Business Media. p. 227. ISBN   978-1-4020-9920-5.
  24. ↑ William, Dudley, ed. (1976). "Nuclear and Atomic Spectroscopy". Spectroscopy. Methods in Experimental Physics. Vol. 13. pp. 115–346 [150]. doi:10.1016/S0076-695X(08)60643-2. ISBN   978-0-12-475913-8.
  25. ↑ Salkind, Neil J. (2010). Encyclopedia of Research Design. SAGE. p. 266. ISBN   978-1-4129-6127-1.
  26. ↑ Klosterman, Richard E. (1990). Community Analysis and Planning Techniques. Rowman & Littlefield Publishers. p. 1. ISBN   978-0-7425-7440-3.
  27. ↑ Yoe, Charles E. (March 1996). An Introduction to Risk and Uncertainty in the Evaluation of Environmental Investments (Report). U.S. Army Corps of Engineers. p. 69. DTIC ADA316839.
  28. ↑ Hamming, Richard (2012). Numerical Methods for Scientists and Engineers. Courier Corporation. ISBN   978-0-486-13482-6.[ page needed ]
  29. ↑ Friedman, Milton (December 1962). "The Interpolation of Time Series by Related Series". Journal of the American Statistical Association. 57 (300): 729–757. doi:10.1080/01621459.1962.10500812.
  30. ↑ Gandhi, Sorabh; Foschini, Luca; Suri, Subhash (2010). "Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order". 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010). pp. 924–935. doi:10.1109/ICDE.2010.5447930. ISBN   978-1-4244-5445-7. S2CID   16072352.
  31. ↑ Sandy Ryza (2020-03-18). "Time Series Analysis with Spark" (slides of a talk at Spark Summit East 2016). Databricks . Retrieved 2021-01-12.
  32. ↑ Zolhavarieh, Seyedjamal; Aghabozorgi, Saeed; Teh, Ying Wah (2014). "A Review of Subsequence Time Series Clustering". The Scientific World Journal. 2014: 312521. doi: 10.1155/2014/312521 . PMC   4130317 . PMID   25140332.
  33. ↑ Keogh, Eamonn; Lin, Jessica (August 2005). "Clustering of time-series subsequences is meaningless: implications for previous and future research". Knowledge and Information Systems. 8 (2): 154–177. doi:10.1007/s10115-004-0172-7.
  34. ↑ Gershenfeld, N. (1999). The Nature of Mathematical Modeling . New York: Cambridge University Press. pp.  205–208. ISBN   978-0521570954.
  35. ↑ Kantz, Holger; Thomas, Schreiber (2004). Nonlinear Time Series Analysis. London: Cambridge University Press. ISBN   978-0521529020.
  36. ↑ Abarbanel, Henry (Nov 25, 1997). Analysis of Observed Chaotic Data. New York: Springer. ISBN   978-0387983721.
  37. ↑ Tomás, R.; Li, Z.; Lopez-Sanchez, J. M.; Liu, P.; Singleton, A. (June 2016). "Using wavelet tools to analyse seasonal variations from InSAR time-series data: a case study of the Huangtupo landslide". Landslides. 13 (3): 437–450. Bibcode:2016Lands..13..437T. doi:10.1007/s10346-015-0589-y. hdl:10045/62160. ISSN   1612-510X.
  38. ↑ Boashash, B. (ed.), (2003) Time-Frequency Signal Analysis and Processing: A Comprehensive Reference, Elsevier Science, Oxford, 2003 ISBN   0-08-044335-4
  39. ↑ Nikolić, Danko; Mureşan, Raul C.; Feng, Weijia; Singer, Wolf (March 2012). "Scaled correlation analysis: a better way to compute a cross-correlogram". European Journal of Neuroscience. 35 (5): 742–762. doi:10.1111/j.1460-9568.2011.07987.x. PMID   22324876. S2CID   4694570.
  40. 1 2 Sakoe, H.; Chiba, S. (February 1978). "Dynamic programming algorithm optimization for spoken word recognition". IEEE Transactions on Acoustics, Speech, and Signal Processing. 26 (1): 43–49. doi:10.1109/TASSP.1978.1163055. S2CID   17900407.
  41. ↑ Mormann, Florian; Andrzejak, Ralph G.; Elger, Christian E.; Lehnertz, Klaus (2007). "Seizure prediction: the long and winding road". Brain . 130 (2): 314–333. doi: 10.1093/brain/awl241 . PMID   17008335.
  42. ↑ Land, Bruce; Elias, Damian. "Measuring the 'Complexity' of a time series".
  43. ↑ Chevyrev, Ilya; Kormilitzin, Andrey (2016). "A Primer on the Signature Method in Machine Learning". arXiv: 1603.03788 .
  44. ↑ Ropella, G.E.P.; Nag, D.A.; Hunt, C.A. (2003). "Similarity measures for automated comparison of in silico and in vitro experimental results". Proceedings of the 25th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (IEEE Cat. No.03CH37439). pp. 2933–2936. doi:10.1109/IEMBS.2003.1280532. ISBN   978-0-7803-7789-9. S2CID   17798157.
  45. ↑ Tominski, Christian; Aigner, Wolfgang. "The TimeViz Browser:A Visual Survey of Visualization Techniques for Time-Oriented Data" . Retrieved 1 June 2014.

Further reading

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.