143 search results - page 2 / 29 » Lazy Learning for Improving Ranking of Decision Trees |
ICML
2003
IEEE
13 years 11 months ago
2003
IEEE
AUC(Area Under the Curve) of ROC(Receiver Operating Characteristics) has been recently used as a measure for ranking performanceof learning algorithms. In this paper, wepresent a ...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy deci...
ICML
2000
IEEE
14 years 6 months ago
2000
IEEE
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
ML
2000
ACM
13 years 5 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
ML
2008
ACM
13 years 5 months ago
2008
ACM
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...