A practical algorithm to find the best subsequence patterns.
Masahiro HiraoHiromasa HoshinoAyumi ShinoharaMasayuki TakedaSetsuo ArikawaPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- dynamic programming
- detection algorithm
- learning algorithm
- k means
- computational complexity
- high accuracy
- objective function
- worst case
- improved algorithm
- experimental evaluation
- significant improvement
- similarity measure
- np hard
- selection algorithm
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- data structure
- tree structure
- classification algorithm
- times faster
- computationally demanding
- convex hull
- expectation maximization
- preprocessing
- data sets
- multi objective