arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.09039cs.DBcs.AI
收藏

高效的过程后缀比较过程后缀比较的预设过程监控

Efficient Distance Pruning for Process Suffix Comparison in Prescriptive Process Monitoring

Université de Technologie de Troyes(特鲁瓦技术大学);QAD Process Intelligence(QAD流程智能公司)

Sarra Madad

AI总结:

本文提出基于三角不等式的高效距离修剪方法,用于加速大规模过程后缀比较,从而提升预设过程监控系统的可扩展性和准确性。

摘要:

预设过程监控旨在通过分析正在进行的案例的可能延续来推荐改进过程结果的行动。一个关键障碍是大规模后缀比较的高计算成本,其随着日志大小的增长而迅速增加。我们提出了一种高效的检索方法,利用三角不等式:到一组优化的枢纽的距离定义了边界,这些边界可以修剪冗余的比较。这大大减少了运行时间,并且可以完全并行化。关键的是,修剪是精确的:检索到的后缀与彻底比较的结果完全相同,从而保持了准确性。这些结果表明,基于度量的修剪可以加速后缀比较,并支持可扩展的预设系统。

英文摘要:

Prescriptive process monitoring seeks to recommend actions that improve process outcomes by analyzing possible continuations of ongoing cases. A key obstacle is the heavy computational cost of large-scale suffix comparisons, which grows rapidly with log size. We propose an efficient retrieval method exploiting the triangle inequality: distances to a set of optimized pivots define bounds that prune redundant comparisons. This substantially reduces runtime and is fully parallelizable. Crucially, pruning is exact: the retrieved suffixes are identical to those from exhaustive comparison, thereby preserving accuracy. These results show that metric-based pruning can accelerate suffix comparison and support scalable prescriptive systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑