Sciweavers

51 search results - page 2 / 11
» Interval and dynamic time warping-based decision trees
Sort
View
HICSS
2003
IEEE
91views Biometrics» more  HICSS 2003»
13 years 10 months ago
Strategic Investment Planning by Using Dynamic Decision Trees
In this paper we shall represent strategic planning problems by dynamic decision trees, in which the nodes are projects that can be deferred or postponed for a certain period of t...
Péter Majlender
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 3 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
KDD
2003
ACM
170views Data Mining» more  KDD 2003»
14 years 5 months ago
Efficient decision tree construction on streaming data
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
Ruoming Jin, Gagan Agrawal
SAC
2005
ACM
13 years 11 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
13 years 9 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...