Sciweavers

352 search results - page 14 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 11 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
88
Voted
AEI
2006
253views more  AEI 2006»
14 years 11 months ago
Computer based pedestrian landscape design using decision tree templates
Machine Learning algorithms can act as a valuable analytical tool in design research. In this paper, we demonstrate the application of a decision tree learning algorithm for desig...
Baranidharan Raman, Jody R. Naderi
99
Voted
ICML
1996
IEEE
15 years 3 months ago
Second Tier for Decision Trees
A learner's performance does not rely only on the representation language and on the algorithm inducing a hypothesis in this language. Also the way the induced hypothesis is ...
Miroslav Kubat
ICML
1990
IEEE
15 years 2 months ago
An Incremental Method for Finding Multivariate Splits for Decision Trees
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
Paul E. Utgoff, Carla E. Brodley
100
Voted
ICML
2006
IEEE
15 years 11 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan