462 search results - page 15 / 93 » Learning DNF by Decision Trees |
171
click to vote
ILP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
193
click to vote
NAACL
2004
15 years 7 months ago
2004
The regular occurrence of disfluencies is a distinguishing characteristic of spontaneous speech. Detecting and removing such disfluencies can substantially improve the usefulness ...
113
click to vote
AAAI
2006
15 years 7 months ago
2006
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
160
click to vote
ICML
1999
IEEE
16 years 6 months ago
1999
IEEE
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
166
click to vote
PAKDD
2010
ACM
15 years 10 months ago
2010
ACM
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...