pith. sign in

arxiv: 1504.00905 · v2 · pith:VDBZ3QZYnew · submitted 2015-04-03 · 🧮 math.OC · cs.CV· cs.LG· cs.SY· eess.SY

Robust Anomaly Detection Using Semidefinite Programming

classification 🧮 math.OC cs.CVcs.LGcs.SYeess.SY
keywords anomalydetectionmomentsproblemadditionapproachapproachesclass
0
0 comments X
read the original abstract

This paper presents a new approach, based on polynomial optimization and the method of moments, to the problem of anomaly detection. The proposed technique only requires information about the statistical moments of the normal-state distribution of the features of interest and compares favorably with existing approaches (such as Parzen windows and 1-class SVM). In addition, it provides a succinct description of the normal state. Thus, it leads to a substantial simplification of the the anomaly detection problem when working with higher dimensional datasets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.