Sciweavers

127 search results - page 6 / 26
» Learning Monotone Decision Trees in Polynomial Time
Sort
View
ICIP
2003
IEEE
14 years 10 months ago
Inverse halftoning by decision tree learning
Inverse halftoning is the process to retrieve a (gray) continuous-tone image from a halftone. Recently, machinelearning-based inverse halftoning techniques have been proposed. Dec...
Hae Yong Kim, Ricardo L. de Queiroz
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 7 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
ICDM
2010
IEEE
154views Data Mining» more  ICDM 2010»
13 years 6 months ago
Discrimination Aware Decision Tree Learning
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
Faisal Kamiran, Toon Calders, Mykola Pechenizkiy
ICML
2002
IEEE
14 years 9 months ago
Learning Decision Trees Using the Area Under the ROC Curve
ROC analysis is increasingly being recognised as an important tool for evaluation and comparison of classifiers when the operating characteristics (i.e. class distribution and cos...
César Ferri, José Hernández-O...
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
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...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...