521 search results - page 74 / 105 » Sparse probabilistic classifiers |
NIPS
2001
13 years 9 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
UAI
1998
13 years 9 months ago
1998
The majority of real-world probabilistic systems are used by more than one user, thus a utility model must be elicited separately for each newuser. Utility elicitation is long and...
TASLP
2008
13 years 7 months ago
2008
The performance of spoken language recognition system is typically formulated to reflect the detection cost and the strategic decision points along the detection-error-tradeoff cur...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—In this paper a novel system for automatic detection and segmentation of focal liver lesions in CT images is presented. It utilizes a probabilistic boosting tree to clas...
EMNLP
2008
13 years 9 months ago
2008
A human annotator can provide hints to a machine learner by highlighting contextual "rationales" for each of his or her annotations (Zaidan et al., 2007). How can one ex...