Optimal Online and Offline Algorithms for Finding Longest and Shortest Subsequences with Length and Sum Constraints.
Sung Kwon KimPublished in: IEICE Trans. Inf. Syst. (2010)
Keyphrases
- exhaustive search
- significant improvement
- real time
- worst case
- theoretical analysis
- approximately optimal
- orders of magnitude
- benchmark datasets
- computationally efficient
- online learning
- machine learning algorithms
- computational complexity
- times faster
- space complexity
- upper bound
- lower bound
- mining algorithm
- objective function
- finding optimal
- data mining