Sciweavers

521 search results - page 52 / 105
» Sparse probabilistic classifiers
Sort
View
NIPS
2001
13 years 9 months ago
Covariance Kernels from Bayesian Generative Models
We propose the framework of mutual information kernels for learning covariance kernels, as used in Support Vector machines and Gaussian process classifiers, from unlabeled task da...
Matthias Seeger
ICML
2002
IEEE
14 years 8 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...
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
SDM
2010
SIAM
144views Data Mining» more  SDM 2010»
13 years 9 months ago
A Probabilistic Framework to Learn from Multiple Annotators with Time-Varying Accuracy
This paper addresses the challenging problem of learning from multiple annotators whose labeling accuracy (reliability) differs and varies over time. We propose a framework based ...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 9 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth