|Burst (ML Engine)||Bursts (splits) a time interval into a series of shorter "burst" intervals and allocates values from the time intervals into the new, shorter subintervals.|
|DTW (ML Engine)||Computes dynamic time warping—similarity between two sequences that vary in time or speed.|
|Interpolator (ML Engine)||Calculates missing values in time series, using either interpolation or aggregation. Interpolation estimates missing values between known values. Aggregation combines known values to produce aggregate value.|
|SAX (ML Engine)||Turns time series into symbolic strings, which are smaller and in which patterns are more obvious. Input and output formats allow SAX to supply data to Shapelet functions.|
|SeriesSplitter (ML Engine)||Splits partition into subpartitions (called splits) by creating additional column that contains split identifier. Optionally copies specified number of boundary rows to each split.|
|TimeSeriesOrders (ML Engine)||Determines orders and whether to incorporate drift term into time series model.|
|VARMAX (ML Engine)||Extends ARMA/ARIMA model to work with time series with multiple response variables (vector time series), as well as exogenous variables, or variables that are independent of other variables in system.|
|VWAP (ML Engine)||Computes the volume-weighted average price of a traded item (usually an equity share) over a specified time interval.|
|ARIMA Functions (ML Engine)||Create and use ARIMA model.|
|Change-Point Detection Functions (ML Engine)||Detect the change points in stochastic process or time series.|
|Convergent Cross-Mapping Functions (ML Engine)||Includes CCMPrepare function, which adds new partition column and partitions data to input to CCM function, which tests multiple causes and effects simultaneously, reporting effect size for each cause-effect pair.|
|Fast Fourier Transform Functions (ML Engine)||FFT uses Fast Fourier Transform (FFT) algorithm to compute discrete Fourier Transform (DFT) of each signal in one or more input table columns. Signal can be either real or complex, and can have one, two, or three dimensions.
IFFT uses inverse Fast Fourier Transform (IFFT) algorithm (also called Fourier synthesis algorithm) to reverse Fast Fourier Transform (FFT) performed by FFT function.
|Moving Average Functions (ML Engine)||Compute average values in a series.|
|Shapelet Functions (ML Engine)||Detect distinguishing features among ordered sequences (time series) and use them to cluster or classify new data.|
|Wavelet Transform Functions (ML Engine)||Implement Mallat algorithm (iterate algorithm in Discrete Wavelet Transform field) and apply wavelet transform on multiple sequences simultaneously, or perform inverse of this process.|