Sciweavers

274 search results - page 5 / 55
» Learning decision trees from dynamic data streams
Sort
View
SSPR
1998
Springer
13 years 11 months ago
Multi-interval Discretization Methods for Decision Tree Learning
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
Petra Perner, Sascha Trautzsch
SSD
2005
Springer
185views Database» more  SSD 2005»
14 years 1 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
ILP
2003
Springer
14 years 22 days ago
A Multi-relational Decision Tree Learning Algorithm - Implementation and Experiments
We describe an efficient implementation (MRDTL-2) of the Multi-relational decision tree learning (MRDTL) algorithm [23] which in turn was based on a proposal by Knobbe et al. [19] ...
Anna Atramentov, Hector Leiva, Vasant Honavar
DAWAK
2006
Springer
13 years 11 months ago
Mixed Decision Trees: An Evolutionary Approach
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
Marek Kretowski, Marek Grzes
DIAGRAMS
2004
Springer
14 years 28 days ago
Decision Diagrams in Machine Learning: An Empirical Study on Real-Life Credit-Risk Data
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result...
Christophe Mues, Bart Baesens, Craig M. Files, Jan...