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

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

  5. Autoencoder - Wikipedia

    en.wikipedia.org/wiki/Autoencoder

    Autoencoders are applied to many problems, including facial recognition, [5] feature detection, [6] anomaly detection, and learning the meaning of words. [7] [8] In terms of data synthesis, autoencoders can also be used to randomly generate new data that is similar to the input (training) data. [6]

  6. One-class classification - Wikipedia

    en.wikipedia.org/wiki/One-class_classification

    In machine learning, one-class classification (OCC), also known as unary classification or class-modelling, tries to identify objects of a specific class amongst all objects, by primarily learning from a training set containing only the objects of that class, [1] although there exist variants of one-class classifiers where counter-examples are used to further refine the classification boundary.

  7. DBSCAN - Wikipedia

    en.wikipedia.org/wiki/DBSCAN

    For example, on polygon data, the "neighborhood" could be any intersecting polygon, whereas the density predicate uses the polygon areas instead of just the object count. Various extensions to the DBSCAN algorithm have been proposed, including methods for parallelization, parameter estimation, and support for uncertain data.

  8. Random sample consensus - Wikipedia

    en.wikipedia.org/wiki/Random_sample_consensus

    A simple example is fitting a line in two dimensions to a set of observations. Assuming that this set contains both inliers, i.e., points which approximately can be fitted to a line, and outliers, points which cannot be fitted to this line, a simple least squares method for line fitting will generally produce a line with a bad fit to the data including inliers and outliers.

  9. OPTICS algorithm - Wikipedia

    en.wikipedia.org/wiki/OPTICS_algorithm

    OPTICS-OF [5] is an outlier detection algorithm based on OPTICS. The main use is the extraction of outliers from an existing run of OPTICS at low cost compared to using a different outlier detection method. The better known version LOF is based on the same concepts.