.png){kind=icon}
返回
Linear programming based time lag identification in event sequences
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2018.08.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Event sequences
Time lag
Optimization
Linear programming
Assignment problem
Root cause analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem基于模拟退火的启发式求解无约束二元二次规划问题的性能
PREAI
分享收藏
查看更多内容