Sciweavers

1683 search results - page 246 / 337
» Learning with Mixtures of Trees
Sort
View
ICML
2004
IEEE
14 years 1 months ago
Ensembles of nested dichotomies for multi-class problems
Nested dichotomies are a standard statistical technique for tackling certain polytomous classification problems with logistic regression. They can be represented as binary trees ...
Eibe Frank, Stefan Kramer
ACL
2006
13 years 9 months ago
Morphological Richness Offsets Resource Demand - Experiences in Constructing a POS Tagger for Hindi
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
Smriti Singh, Kuhoo Gupta, Manish Shrivastava, Pus...
COLT
1999
Springer
14 years 9 days ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
CIKM
2008
Springer
13 years 10 months ago
Active relevance feedback for difficult queries
Relevance feedback has been demonstrated to be an effective strategy for improving retrieval accuracy. The existing relevance feedback algorithms based on language models and vect...
Zuobing Xu, Ram Akella
ML
2000
ACM
124views Machine Learning» more  ML 2000»
13 years 7 months ago
Text Classification from Labeled and Unlabeled Documents using EM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...
Kamal Nigam, Andrew McCallum, Sebastian Thrun, Tom...