12 search results - page 2 / 3 » Generalized Entropy for Splitting on Numerical Attributes in... |
KDD
1999
ACM
13 years 9 months ago
1999
ACM
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
KDD
2003
ACM
14 years 5 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
ICML
2000
IEEE
14 years 6 months ago
2000
IEEE
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...
ICML
1999
IEEE
14 years 6 months ago
1999
IEEE
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...