========== Algorithms ========== .. toctree:: :maxdepth: 1 Backward Difference Backward Moving Average Backward Moving Median Box-Cox Transformation Boxplot Brown's Double Exponential Smoothing Bubble Sort C4.5 Centered Moving Average Centered Moving Median Central Difference Chi-Squared Test Class-attribute Interdependence Maximization (CAIM) Cumulative Sum (CUSUM) Decimal Scaling Dixon Type (Q) Tests Equal-frequency Interval Binning Equal-width Interval Binning Fast Fourier Transform Forward Difference Forward Moving Average Forward Moving Median Grubbs' Test Hampel Identifier Holt-Winters Double Exponential Smoothing K-Means Clustering Linear Regression Locally Weighted Scatterplot Smoothing (LOWESS) Maximum Likelihood Mean Mean Absolute Deviation Median Midrange Min-Max Scaling Mode One-Rule Discretizer (1RD) <1RD/index> One-sided Median Polynomial Regression Principal Component Analysis Quick Sort Robust Locally Weighted Scatterplot Smoothing (RLOWESS) Runs Test Savitzky-Golay Algorithm Selection Sort Sign Test Simple Random Sample with Replacement Simple Random Sample without Replacement Single Exponential Smoothing Standard Deviation Tietjen-Moore Test Top Percentile Filter Trimmed Mean Two-sided Median Unitnorm Scaling Weighted Backward Moving Average Weighted Centered Moving Average Weighted Forward Moving Average Weighted Mean Zero-Mean Scaling