Using symbol clustering to improve probabilistic automaton inference

1998 ◽  
pp. 232-243 ◽  
Author(s):  
Pierre Dupont ◽  
Lin Chase
Keyword(s):  
Probabilistic Automaton

The stability of internal states of a probabilistic automaton

Cybernetics ◽  
1973 ◽  
Vol 6 (6) ◽  
pp. 759-765
Author(s):  
N. Ya. Parshenkov ◽  
V. M. Chentsov
Keyword(s):  
Probabilistic Automaton ◽  
Internal States ◽  
The Stability

GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS

2011 ◽  
Vol 22 (04) ◽  
pp. 883-904 ◽  
Author(s):  
CYRIL ALLAUZEN ◽  
MEHRYAR MOHRI ◽  
ASHISH RASTOGI
Keyword(s):  
General Problem ◽  
Finite Automata ◽  
General Algorithm ◽  
Approximate Computation ◽  
Probabilistic Automaton ◽  
Bounded Delay ◽  
Finite State Transducers ◽  
Specific Analysis ◽  
Finite State

We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ε-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time [Formula: see text], and finite or polynomial ambiguity in time [Formula: see text], where |A|E denotes the number of transitions of A. These complexities significantly improve over the previous best complexities given for the same problem. Furthermore, the algorithms presented are simple and based on a general algorithm for the composition or intersection of automata. Additionally, we give an algorithm to determine in time [Formula: see text] the degree of polynomial ambiguity of a polynomially ambiguous automaton A and present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton. We also study the double-tape ambiguity of finite-state transducers. We show that the general problem is undecidable and that it is NP-hard for acyclic transducers. We present a specific analysis of the double-tape ambiguity of transducers with bounded delay. In particular, we give a characterization of double-tape ambiguity for synchronized transducers with zero delay that can be tested in quadratic time and give an algorithm for testing the double-tape ambiguity of transducers with bounded delay.

ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA

2008 ◽  
Vol 19 (01) ◽  
pp. 219-242 ◽  
Author(s):  
CORINNA CORTES ◽  
MEHRYAR MOHRI ◽  
ASHISH RASTOGI ◽  
MICHAEL RILEY
Keyword(s):  
Machine Learning ◽  
Relative Entropy ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Probabilistic Automaton ◽  
Probabilistic Automata ◽  
Gaussian Kernels ◽  
Shortest Distance ◽  
Distance Problem ◽  
Number Of Publications

We present an exhaustive analysis of the problem of computing the relative entropy of two probabilistic automata. We show that the problem of computing the relative entropy of unambiguous probabilistic automata can be formulated as a shortest-distance problem over an appropriate semiring, give efficient exact and approximate algorithms for its computation in that case, and report the results of experiments demonstrating the practicality of our algorithms for very large weighted automata. We also prove that the computation of the relative entropy of arbitrary probabilistic automata is PSPACE-complete. The relative entropy is used in a variety of machine learning algorithms and applications to measure the discrepancy of two distributions. We examine the use of the symmetrized relative entropy in machine learning algorithms and show that, contrarily to what is suggested by a number of publications in that domain, the symmetrized relative entropy is neither positive definite symmetric nor negative definite symmetric, which limits its use and application in kernel methods. In particular, the convergence of training for learning algorithms is not guaranteed when the symmetrized relative entropy is used directly as a kernel, or as the operand of an exponential as in the case of Gaussian Kernels. Finally, we show that our algorithm for the computation of the entropy of an unambiguous probabilistic automaton can be generalized to the computation of the norm of an unambiguous probabilistic automaton by using a monoid morphism. In particular, this yields efficient algorithms for the computation of the Lp-norm of a probabilistic automaton.

scholarly journals Investigation of a model of probabilistic automata for detecting changes in the state of resources of autonomous measurement systems

2020 ◽  
pp. 58-64
Author(s):  
A.V. Skatkov ◽  
◽  
A.A. Bryukhovetsky ◽  
D.V. Moiseev ◽  
◽  
...  
Keyword(s):  
Communication Channel ◽  
Environmental Parameters ◽  
The State ◽  
Adaptive Model ◽  
Probabilistic Automaton ◽  
Algorithmic Approach ◽  
Measurement Systems ◽  
Adaptive Correction ◽  
Self Tuning ◽  
Intelligent Technology

An algorithmic approach based on the methods of adaptive intelligent technology for monitoring the state of objects of computer systems is considered. The approach is focused on detecting changes in the state of controlled resources of autonomous information and measurement systems: communication channel, processor, memory, and battery. An adaptive model is presented using a Bayesian classifier for estimating changes in the state of resources of autonomous information and measurement systems. The model is based on a probabilistic automaton with adaptive self-tuning. The paper describes an approach that allows increasing the duration of continuous operation of the system for monitoring environmental parameters. This approach is based on adaptive correction of primary meter readings in the event of a decrease in their accuracy due to degradation failures.

scholarly journals Development of anomalous computer behavior detection method based on probabilistic automaton

2018 ◽  
Vol 24 (3) ◽  
Author(s):  
Светлана Юрьевна Гавриленко ◽  
Сергей Геннадиевич Семенов ◽  
Виктор Владимирович Челак
Keyword(s):  
Detection Method ◽  
Probabilistic Automaton ◽  
Behavior Detection
Sign in / Sign up

Export Citation Format

Share Document