38 search results - page 3 / 8 » Learning Binary Relations Using Weighted Majority Voting |
123
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We outline an incremental learning algorithm designed for nonstationary environments where the underlying data distribution changes over time. With each dataset drawn from a new e...
124
click to vote
COLT
1999
Springer
15 years 6 months ago
1999
Springer
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
165
Voted
SIGIR
2012
ACM
13 years 5 months ago
2012
ACM
In crowdsourced relevance judging, each crowd worker typically judges only a small number of examples, yielding a sparse and imbalanced set of judgments in which relatively few wo...
114
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
124
Voted
EMNLP
2010
15 years 16 days ago
2010
Confidence-Weighted linear classifiers (CW) and its successors were shown to perform well on binary and multiclass NLP problems. In this paper we extend the CW approach for sequen...