51 search results - page 1 / 11 » Interval and dynamic time warping-based decision trees |
SAC
2004
ACM
13 years 10 months ago
2004
ACM
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
SIAMCOMP
2012
11 years 7 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
ALGORITHMICA
2010
13 years 5 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
WSC
2004
13 years 6 months ago
2004
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...