arrow
Return

Linear programming based time lag identification in event sequences

delete2018-12-01
delete1
PRE
AI
M
Marco F. Huber *
M
Marc-André Zöller
M
Marcus Baum
DOI:10.1016/j.automatica.2018.08.025delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Many technical systems like manufacturing plants or software applications generate large event sequences. Knowing the temporal relationship between events is important for gaining insights into the status and behavior of the system. This paper proposes a novel approach for identifying the time lag between different event types. This identification task is formulated as a binary integer optimization problem that can be solved efficiently and close to optimality by means of a linear programming approximation. The performance of the proposed approach is demonstrated on synthetic and real-world event sequences. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Event sequences
Time lag
Optimization
Linear programming
Assignment problem
Root cause analysis
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Automatica cover
Automatica
IF:
5.9
Papers:
1.2W
Citations:
5.2W

Organization

U
University of Gottingen
Scholars:
2.5W
Papers: 2.1W
Citations: 36