ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA

DOI10.1142/S0129054108005644zbMath1169.68462MaRDI QIDQ3532153

Ashish Rastogi, Michael D. Riley, Mehryar Mohri, Corinna Cortes

Publication date: 3 November 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

machine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Computation of moments for probabilistic finite-state automata ⋮ OpenFst: A General and Efficient Weighted Finite-State Transducer Library ⋮ GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS

Cites Work

• Unnamed Item
• Algebraic structures for transitive closure
• The consensus string problem and the complexity of comparing hidden Markov models.
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Biological Sequence Analysis
• Some inequalities for information divergence and related measures of discrimination
• Probabilistic automata

This page was built for publication: ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA