Sciweavers

254 search results - page 19 / 51
» Multi-interval Discretization Methods for Decision Tree Lear...
Sort
View
ICML
1998
IEEE
14 years 8 months ago
Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting
In a recent paper, Friedman, Geiger, and Goldszmidt [8] introduced a classifier based on Bayesian networks, called Tree Augmented Naive Bayes (TAN), that outperforms naive Bayes a...
Moisés Goldszmidt, Nir Friedman, Thomas J. ...
NIPS
2007
13 years 9 months ago
Active Preference Learning with Discrete Choice Data
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
Eric Brochu, Nando de Freitas, Abhijeet Ghosh
ICCV
2005
IEEE
14 years 9 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
BMCBI
2008
219views more  BMCBI 2008»
13 years 7 months ago
Classification of premalignant pancreatic cancer mass-spectrometry data using decision tree ensembles
Background: Pancreatic cancer is the fourth leading cause of cancer death in the United States. Consequently, identification of clinically relevant biomarkers for the early detect...
Guangtao Ge, G. William Wong
JDWM
2007
107views more  JDWM 2007»
13 years 7 months ago
Evolutionary Induction of Mixed Decision Trees
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
Marek Kretowski, Marek Grzes