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.

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 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 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.

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.

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

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]}

Further information: Exploratory analysis |

A straightforward way to examine a regular time series is manually with a line chart. An example chart is shown on the right for tuberculosis incidence in the United States, made with a spreadsheet program. The number of cases was standardized to a rate per 100,000 and the percent change per year in this rate was calculated. The nearly steadily dropping line shows that the TB incidence was decreasing in most years, but the percent change in this rate varied by as much as +/- 10%, with 'surges' in 1975 and around the early 1990s. The use of both vertical axes allows the comparison of two time series in one graphic.

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.^{[7]} Visual tools that represent time series data as heat map matrices can help overcome these challenges.

Other techniques include:

- Autocorrelation analysis to examine serial dependence
- Spectral analysis to examine cyclic behavior which need not be related to seasonality. For example, sunspot activity varies over 11 year cycles.
^{[8]}^{[9]}Other common examples include celestial phenomena, weather patterns, neural activity, commodity prices, and economic activity. - Separation into components representing trend, seasonality, slow and fast variation, and cyclical irregularity: see trend estimation and decomposition of time series

Main article: Curve fitting |

Curve fitting^{[10]}^{[11]} is the process of constructing a curve, or mathematical function, that has the best fit to a series of data points,^{[12]} possibly subject to constraints.^{[13]}^{[14]} Curve fitting can involve either interpolation,^{[15]}^{[16]} where an exact fit to the data is required, or smoothing,^{[17]}^{[18]} in which a "smooth" function is constructed that approximately fits the data. A related topic is regression analysis,^{[19]}^{[20]} 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,^{[21]}^{[22]} to infer values of a function where no data are available,^{[23]} and to summarize the relationships among two or more variables.^{[24]} Extrapolation refers to the use of a fitted curve beyond the range of the observed data,^{[25]} and is subject to a degree of uncertainty^{[26]} since it may reflect the method used to construct the curve as much as it reflects the observed data.

For processes that are expected to generally grow in magnitude one of the curves in the graphic at right (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").^{[27]} 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.^{[28]} Alternatively polynomial interpolation or spline interpolation is used where piecewise polynomial functions are fit into 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.

Main article: 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^{[29]} 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.

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.

- Fully formed statistical models for stochastic simulation purposes, so as to generate alternative versions of the time series, representing what might happen over non-specific time-periods in the future
- Simple or fully formed statistical models to describe the likely outcome of the time series in the immediate future, given knowledge of the most recent outcomes (forecasting).
- Forecasting on time series is usually done using automated statistical software packages and programming languages, such as Julia, Python, R, SAS, SPSS and many others.
- Forecasting on large scale data can be done with Apache Spark using the Spark-TS library, a third-party package.
^{[30]}

Main article: Statistical classification |

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

See also: Signal processing and Estimation theory |

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

Main article: Time-series 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.

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

- whole time series clustering (multiple time series for which to find a cluster)
- subsequence time series clustering (single timeseries, split into chunks using sliding windows)
- time point clustering

Subsequence time series clustering resulted in unstable (random) clusters *induced by the feature extraction* using chunking with sliding windows.^{[32]} 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 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.^{[33]} 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),^{[34]} and (Abarbanel)^{[35]}

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. 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.

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*= (*X*_{1},*X*_{2}, ...).

Another common notation is

*Y*= (*Y*:_{t}*t*∈*T*),

where *T* is the index set.

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.^{[36]}

Tools for investigating time-series data include:

- Consideration of the autocorrelation function and the spectral density function (also cross-correlation functions and cross-spectral density functions)
- Scaled cross- and auto-correlation functions to remove contributions of slow components
^{[37]} - Performing a Fourier transform to investigate the series in the frequency domain
- Discrete, continuous or mixed spectra of time series, depending on whether the time series contains a (generalized) harmonic signal or not
- Use of a filter to remove unwanted noise
- Principal component analysis (or empirical orthogonal function analysis)
- Singular spectrum analysis
- "Structural" models:
- General state space models
- Unobserved components models

- Machine learning
- Queueing theory analysis
- Control chart
- Detrended fluctuation analysis
- Nonlinear mixed-effects modeling
- Dynamic time warping
^{[38]} - Dynamic Bayesian network
- Time-frequency analysis techniques:
- Chaotic analysis

Time-series metrics or features that can be used for time series classification or regression analysis:^{[39]}

**Univariate linear measures**- Moment (mathematics)
- Spectral band power
- Spectral edge frequency
- Accumulated energy (signal processing)
- Characteristics of the autocorrelation function
- Hjorth parameters
- FFT parameters
- Autoregressive model parameters
- Mann–Kendall test

**Univariate non-linear measures**- Measures based on the correlation sum
- Correlation dimension
- Correlation integral
- Correlation density
- Correlation entropy
- Approximate entropy
^{[40]} - Sample entropy
- Fourier entropyuk
- Wavelet entropy
- Dispersion entropy
- Fluctuation dispersion entropy
- Rényi entropy
- Higher-order methods
- Marginal predictability
- Dynamical similarity index
- State space dissimilarity measures
- Lyapunov exponent
- Permutation methods
- Local flow

**Other univariate measures**- Algorithmic complexity
- Kolmogorov complexity estimates
- Hidden Markov model states
- Rough path signature
^{[41]} - Surrogate time series and surrogate correction
- Loss of recurrence (degree of non-stationarity)

**Bivariate linear measures**- Maximum linear cross-correlation
- Linear Coherence (signal processing)

**Bivariate non-linear measures**- Non-linear interdependence
- Dynamical Entrainment (physics)
- Measures for phase synchronization
- Measures for phase locking

**Similarity measures**:^{[42]}- Cross-correlation
- Dynamic time warping
^{[38]} - Hidden Markov model
- Edit distance
- Total correlation
- Newey–West estimator
- Prais–Winsten transformation
- Data as vectors in a metrizable space
- Data as time series with envelopes
- Global standard deviation
- Local standard deviation
- Windowed standard deviation

- Data interpreted as stochastic series
- Data interpreted as a probability distribution function

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)^{[43]}

- Braided graphs
- Line charts
- Slope graphs
- GapChartfr

- Horizon graphs
- Reduced line chart (small multiples)
- Silhouette graph
- Circular silhouette graph