Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences.
H. K. DaiPublished in: COCOON (2001)
Keyphrases
- lower bound
- computational cost
- experimental evaluation
- fixed length
- dynamic programming
- significant improvement
- detection method
- clustering method
- high accuracy
- data sets
- high precision
- synthetic data
- genetic algorithm
- probabilistic model
- objective function
- scheduling problem
- variable length
- branch and bound algorithm
- sequential patterns
- feature set
- support vector machine
- decision trees
- similarity measure
- cost function
- feature vectors
- multiscale
- preprocessing
- computational complexity