When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Anomaly detection - Wikipedia

    en.wikipedia.org/wiki/Anomaly_detection

    ELKI is an open-source Java data mining toolkit that contains several anomaly detection algorithms, as well as index acceleration for them. PyOD is an open-source Python library developed specifically for anomaly detection. [56] scikit-learn is an open-source Python library that contains some algorithms for unsupervised anomaly detection.

  3. Isolation forest - Wikipedia

    en.wikipedia.org/wiki/Isolation_forest

    Isolation Forest is an algorithm for data anomaly detection using binary trees.It was developed by Fei Tony Liu in 2008. [1] It has a linear time complexity and a low memory use, which works well for high-volume data.

  4. ELKI - Wikipedia

    en.wikipedia.org/wiki/ELKI

    Version 0.2 (July 2009) added functionality for time series analysis, in particular distance functions for time series. [ 13 ] Version 0.3 (March 2010) extended the choice of anomaly detection algorithms and visualization modules.

  5. Change detection - Wikipedia

    en.wikipedia.org/wiki/Change_detection

    In statistical analysis, change detection or change point detection tries to identify times when the probability distribution of a stochastic process or time series changes. In general the problem concerns both detecting whether or not a change has occurred, or whether several changes might have occurred, and identifying the times of any such ...

  6. CUSUM - Wikipedia

    en.wikipedia.org/wiki/CUSUM

    The low CUSUM value, detecting a negative anomaly, + = (, +) where ω {\displaystyle \omega } is a critical level parameter (tunable, same as threshold T) that's used to adjust the sensitivity of change detection: larger ω {\displaystyle \omega } makes CUSUM less sensitive to the change and vice versa.

  7. Local outlier factor - Wikipedia

    en.wikipedia.org/wiki/Local_outlier_factor

    In anomaly detection, the local outlier factor (LOF) is an algorithm proposed by Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng and Jörg Sander in 2000 for finding anomalous data points by measuring the local deviation of a given data point with respect to its neighbours.

  8. DBSCAN - Wikipedia

    en.wikipedia.org/wiki/DBSCAN

    DBSCAN is one of the most commonly used and cited clustering algorithms. [2] In 2014, the algorithm was awarded the Test of Time Award (an award given to algorithms which have received substantial attention in theory and practice) at the leading data mining conference, ACM SIGKDD. [3]

  9. Recurrent neural network - Wikipedia

    en.wikipedia.org/wiki/Recurrent_neural_network

    The standard method for training RNN by gradient descent is the "backpropagation through time" (BPTT) algorithm, which is a special case of the general algorithm of backpropagation. A more computationally expensive online variant is called "Real-Time Recurrent Learning" or RTRL, [ 78 ] [ 79 ] which is an instance of automatic differentiation in ...