Sciweavers

59 search results - page 6 / 12
» Learning Tree Augmented Naive Bayes for Ranking
Sort
View
94
Voted
ICML
1998
IEEE
16 years 14 days 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. ...
93
Voted
ICML
2006
IEEE
16 years 14 days ago
An empirical comparison of supervised learning algorithms
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
Rich Caruana, Alexandru Niculescu-Mizil
103
Voted
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
16 years 1 days ago
A parallel learning algorithm for text classification
Text classification is the process of classifying documents into predefined categories based on their content. Existing supervised learning algorithms to automatically classify te...
Canasai Kruengkrai, Chuleerat Jaruskulchai
ICML
2005
IEEE
16 years 14 days ago
Predicting good probabilities with supervised learning
We examine the relationship between the predictions made by different learning algorithms and true posterior probabilities. We show that maximum margin methods such as boosted tre...
Alexandru Niculescu-Mizil, Rich Caruana
EMNLP
2010
14 years 9 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...