We present the efficient implementations of probabilistic deterministic finite automaton learning methods available in FlexFringe. These implement well-known strategies for state-merging including several modifications to improve their performance in practice. We show experimentally that these algorithms obtain competitive results and significant improvements over a default implementation. We also demonstrate how to use FlexFringe to learn interpretable models from software logs and use these for anomaly detection. Although less interpretable, we show that learning smaller more convoluted models improves the performance of FlexFringe on anomaly detection, outperforming an existing solution based on neural nets.

翻译：我们介绍了FlexFringe中高效实现的概率确定性有限自动机学习方法。这些方法实现了状态合并的经典策略，并包含若干改进以提升实际性能。实验表明，这些算法在默认实现基础上取得了具有竞争力的结果和显著改进。我们还演示了如何使用FlexFringe从软件日志中学习可解释模型，并将其用于异常检测。尽管可解释性较弱，但学习更小、更复杂的模型能提升FlexFringe在异常检测中的性能，优于基于神经网络的现有方案。