1421 search results - page 21 / 285 » Algorithms for subsequence combinatorics |
165
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
71
Voted
JMLR
2010
14 years 4 months ago
2010
Model selection strategies for machine learning algorithms typically involve the numerical optimisation of an appropriate model selection criterion, often based on an estimator of...
147
Voted
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...