A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.
Siang-Huai HungChang-Biau YangKuo-Si HuangPublished in: ICS (2018)
Keyphrases
- computational cost
- learning algorithm
- times faster
- search space
- k means
- experimental evaluation
- cost function
- dynamic programming
- beam search
- detection algorithm
- optimization algorithm
- preprocessing
- computational complexity
- significant improvement
- evolutionary algorithm
- expectation maximization
- matching algorithm
- objective function
- convergence rate
- recognition algorithm
- supervised learning
- worst case
- decision trees