Sciweavers

1275 search results - page 32 / 255
» Chunking with Decision Trees
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
IJCAI
2003
13 years 9 months ago
Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
David Page, Soumya Ray
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 6 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
DMIN
2009
223views Data Mining» more  DMIN 2009»
13 years 5 months ago
Are Decision Trees Always Greener on the Open (Source) Side of the Fence?
- This short paper compares the performance of three popular decision tree algorithms: C4.5, C5.0, and WEKA's J48. These decision tree algorithms are all related in that C5.0 ...
Samuel Moore, Daniel D'Addario, James Kurinskas, G...
INTERSPEECH
2010
13 years 2 months ago
Decision tree state clustering with word and syllable features
In large vocabulary continuous speech recognition, decision trees are widely used to cluster triphone states. In addition to commonly used phonetically based questions, others hav...
Hank Liao, Christopher Alberti, Michiel Bacchiani,...