Extension of the Blahut-Arimoto Algorithm for Maximizing Directed Information.
Iddo NaissHaim H. PermuterPublished in: IEEE Trans. Inf. Theory (2013)
Keyphrases
- preprocessing
- experimental evaluation
- detection algorithm
- high accuracy
- worst case
- computational complexity
- theoretical analysis
- improved algorithm
- dynamic programming
- cost function
- learning algorithm
- domain knowledge
- computationally efficient
- simulated annealing
- optimization algorithm
- matching algorithm
- times faster
- selection algorithm
- information loss
- estimation algorithm
- final result
- probabilistic model
- computational cost
- np hard
- optimal solution
- information sources
- expectation maximization
- information processing
- particle swarm optimization
- end users
- ant colony optimization
- prior information
- multi objective
- significant improvement
- k means