| Talk | |||||||||||
| Title | Algorithms for Anomaly Detection - Lecture 1 | ||||||||||
| Video |
| ||||||||||
| Author(s) | Davis, Michael (speaker) (CERN) | ||||||||||
| Corporate author(s) | CERN. Geneva | ||||||||||
| Imprint | 2017-03-06. - Streaming video. | ||||||||||
| Series | (inverted CSC) (Inverted CERN School of Computing 2017) | ||||||||||
| Lecture note | on 2017-03-06T16:00:00 | ||||||||||
| Subject category | inverted CSC | ||||||||||
| Abstract | The concept of statistical anomalies, or outliers, has fascinated experimentalists since the earliest attempts to interpret data. We want to know why some data points don’t seem to belong with the others: perhaps we want to eliminate spurious or unrepresentative data from our model. Or, the anomalies themselves may be what we are interested in: an outlier could represent the symptom of a disease, an attack on a computer network, a scientific discovery, or even an unfaithful partner. We start with some general considerations, such as the relationship between clustering and anomaly detection, the choice between supervised and unsupervised methods, and the difference between global and local anomalies. Then we will survey the most representative anomaly detection algorithms, highlighting what kind of data each approach is best suited to, and discussing their limitations. We will finish with a discussion of the difficulties of anomaly detection in high-dimensional data and some new directions for anomaly detection research. | ||||||||||
| Copyright/License | © 2017-2024 CERN | ||||||||||
| Submitted by | catharine.noble@cern.ch | ||||||||||
Record created 2017-03-07, last modified 2022-11-02
Talk details