FlexFringe: Modeling Software Behavior by Learning Probabilistic Automata
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.
Code (1)
Tasks
Anomaly DetectionSimilar Papers 제목 키워드 기반
Probabilistic Software Modeling: A Data-driven Paradigm for Software Analysis
Software systems are complex, and behavioral comprehension with the increasing amount of AI components challenges traditional testing and maintenance strategies.The lack of tools and methodologies for behavioral software…
Anomaly DetectionApproximating probabilistic models as weighted finite automata
Weighted finite automata (WFA) are often used to represent probabilistic models, such as $n$-gram language models, since they are efficient for recognition tasks in time and space. The probabilistic source to be represen…
RNA-2QCFA: Evolving Two-way Quantum Finite Automata with Classical States for RNA Secondary Structures
Recently, the use of mathematical methods and computer science applications have got significant response among biochemists and biologists to modeling the biological systems. The computational and mathematical methods ha…
Quantum Tensor Networks, Stochastic Processes, and Weighted Automata
Modeling joint probability distributions over sequences has been studied from many perspectives. The physics community developed matrix product states, a tensor-train decomposition for probabilistic modeling, motivated b…
Tensor NetworksMixed Nondeterministic-Probabilistic Automata: Blending graphical probabilistic models with nondeterminism
Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks and factor graphs. In this paper we develo…
Probabilistic Programming