2161 search results - page 111 / 433 » Learning to classify e-mail |
101
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
The design of robust classifiers, which can contend with the noisy and outlier ridden datasets typical of computer vision, is studied. It is argued that such robustness requires l...
115
click to vote
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
When data collection is costly and/or takes a significant amount of time, an early prediction of the classifier performance is extremely important for the design of the data minin...
AUSAI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
DIS
2004
Springer
15 years 4 months ago
2004
Springer
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....
101
click to vote
AUSAI
2003
Springer
15 years 4 months ago
2003
Springer
We investigate why discretization is effective in naive-Bayes learning. We prove a theorem that identifies particular conditions under which discretization will result in naiveBay...