Efficient Computation of the Relative Entropy of Probabilistic Automata.
Corinna CortesMehryar MohriAshish RastogiMichael RileyPublished in: LATIN (2006)
Keyphrases
- efficient computation
- probabilistic automata
- relative entropy
- information theoretic
- information theory
- mutual information
- covariance matrix
- log likelihood
- finite automata
- kullback leibler divergence
- maximum entropy
- mahalanobis distance
- bregman divergences
- markov chain
- ranking functions
- data points
- principal component analysis
- upper bound