226 search results - page 1 / 46 » A Practical Algorithm to Find the Best Subsequence Patterns |
DIS
2000
Springer
13 years 8 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
DIS
2001
Springer
13 years 9 months ago
2001
Springer
Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimiza...
IADIS
2003
13 years 5 months ago
2003
This paper describes capturing design experiences by applying grounded theory to pattern mining. The presented approach aims at inducing expert development knowledge and its subse...
CAI
2010
Springer
13 years 1 months ago
2010
Springer
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
JMLR
2010
12 years 11 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...