A fast sequential algorithm for the matrix chain ordering problem.
Jerry Lacmou ZeutouoVianney Kengne TchendjiJean Frédéric MyoupoPublished in: Concurr. Comput. Pract. Exp. (2021)
Keyphrases
- learning algorithm
- dynamic programming
- improved algorithm
- detection algorithm
- objective function
- significant improvement
- computationally efficient
- preprocessing
- k means
- np hard
- theoretical analysis
- tree structure
- matching algorithm
- times faster
- experimental evaluation
- recognition algorithm
- cost function
- neural network
- convergence rate
- nonnegative matrix factorization
- sparse matrix
- expectation maximization
- input data
- linear programming
- high accuracy
- worst case
- hidden markov models
- search space
- reinforcement learning
- similarity measure