Scalable anomaly detection in large homogeneous populations

From MaRDI portal
Publication:458772

DOI10.1016/J.AUTOMATICA.2014.03.008zbMATH Open1296.93041DBLPjournals/automatica/OhlssonCPLS14arXiv1309.5803OpenAlexW2963062431WikidataQ59591806 ScholiaQ59591806MaRDI QIDQ458772FDOQ458772

Sina Khoshfetrat Pakazad, Tianshi Chen, S. Shankar Sastry, Lennart Ljung, Henrik Ohlsson

Publication date: 8 October 2014

Published in: Automatica (Search for Journal in Brave)

Abstract: Anomaly detection in large populations is a challenging but highly relevant problem. The problem is essentially a multi-hypothesis problem, with a hypothesis for every division of the systems into normal and anomal systems. The number of hypothesis grows rapidly with the number of systems and approximate solutions become a necessity for any problems of practical interests. In the current paper we take an optimization approach to this multi-hypothesis problem. We first observe that the problem is equivalent to a non-convex combinatorial optimization problem. We then relax the problem to a convex problem that can be solved distributively on the systems and that stays computationally tractable as the number of systems increase. An interesting property of the proposed method is that it can under certain conditions be shown to give exactly the same result as the combinatorial multi-hypothesis problem and the relaxation is hence tight.


Full work available at URL: https://arxiv.org/abs/1309.5803




Recommendations




Cites Work


Cited In (2)

Uses Software





This page was built for publication: Scalable anomaly detection in large homogeneous populations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458772)