352 search results - page 38 / 71 » A Fast Decision Tree Learning Algorithm |
WFLP
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
IJCAI
1993
15 years 11 days ago
1993
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
74
Voted
KDD
1998
ACM
15 years 3 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
SAC
2002
ACM
14 years 10 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
ECML
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...