Sciweavers

686 search results - page 59 / 138
» Minimax Probability Machine
Sort
View
ICML
2004
IEEE
14 years 11 months ago
Learning Bayesian network classifiers by maximizing conditional likelihood
Bayesian networks are a powerful probabilistic representation, and their use for classification has received considerable attention. However, they tend to perform poorly when lear...
Daniel Grossman, Pedro Domingos
ICML
2003
IEEE
14 years 11 months ago
Tractable Bayesian Learning of Tree Augmented Naive Bayes Models
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....
Jesús Cerquides, Ramon López de M&aa...
ALT
2002
Springer
14 years 7 months ago
A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
Johannes Fürnkranz
ICML
2009
IEEE
14 years 5 months ago
Decision tree and instance-based learning for label ranking
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
Weiwei Cheng, Jens C. Huhn, Eyke Hüllermeier
COLT
2007
Springer
14 years 4 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret