Name
Abstract | ||
|---|---|---|
The problem of anomaly detection is a critical topic across application domains and is the subject of extensive research. Applications include finding frauds and intrusions, warning on robot safety, and many others. Standard approaches in this field exploit simple or complex system models, created by experts using detailed domain knowledge. In this paper, we put forth a statistics-based anomaly detector motivated by the fact that anomalies are sparse by their very nature. Powerful sparsity directed algorithms-namely Robust Principal Component Analysis and the Group Fused LASSO-form the basis of the methodology. Our novel unsupervised single-step solution imposes a convex optimisation task on the vector time series data of the monitored system by employing group-structured, switching and robust regularisation techniques. We evaluated our method on data generated by using a Baxter robot arm that was disturbed randomly by a human operator. Our procedure was able to outperform two baseline schemes in terms of F-1 score. Generalisations to more complex dynamical scenarios are desired. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-26555-1_47 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Anomaly detection,Data mining,Domain knowledge,Computer science,Group lasso,Exploit,Robust principal component analysis,Artificial intelligence,Robot,Machine learning | Conference | 9491 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.37 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zoltán Ádám Milacski | 1 | 5 | 3.47 |
| Marvin Ludersdorfer | 2 | 19 | 1.62 |
| András L ' ́ orincz | 3 | 23 | 3.64 |
| Patrick van der Smagt | 4 | 188 | 24.23 |