Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,568,974 papers from all fields of science
Search
Sign In
Create Free Account
Weighted Majority Algorithm
In machine learning, Weighted Majority Algorithm (WMA) is a meta-learning algorithm used to construct a compound algorithm from a pool of prediction…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Machine learning
Randomized weighted majority algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Algorithms and Improved bounds for online learning under finite hypothesis class
Ankit Sharma
,
Late C. A. Murthy
arXiv.org
2019
Corpus ID: 85517964
Online learning is the process of answering a sequence of questions based on the correct answers to the previous questions. It is…
Expand
2013
2013
Lecture 2: Weighted Majority Algorithm
Jacob D. Abernethy
,
Petter Nilsson
2013
Corpus ID: 123224022
Lecture 1 ended by studying the problem of predicting the outcomes of games played among k teams, where a game between two of…
Expand
2013
2013
A social approach for learning agents
F. Enembreck
,
J. Barthès
Expert systems with applications
2013
Corpus ID: 5583255
2011
2011
Augmenting the analyst via situation-dependent reasoning with trust-annotated facts
B. Ulicny
,
G. Powell
,
Chester F. Brown
,
M. Kokar
,
C. Matheus
,
Jerzy Letkowski
Conference on Cognitive and Computational Aspects…
2011
Corpus ID: 17267727
We say that a computer program augments the analyst if it can infer facts that are implicit in existing information, but that may…
Expand
2010
2010
Counting Rankings
Jason Riggle
2010
Corpus ID: 16436419
In this paper, I present a recursive algorithm that calculates the number of rankings that are consistent with a set of data (i.e…
Expand
2009
2009
Weighted Majority Algorithm Follow the Perturbed Leader
David He
,
Chris Hopman
2009
Corpus ID: 14751150
17.3.1 Follow the Perturbed Leader 17.3.1.1 Prediction Problem Recall the prediction problem that we discussed in class. In that…
Expand
2001
2001
Population Computation and Majority Inference in Test Tube
Y. Sakakibara
DNA
2001
Corpus ID: 42659717
We consider a probabilistic interpretation of the test tube which contains a large amount of DNA strands, and propose a…
Expand
2000
2000
Recognizing bounds of context change in on-line learning
Helen Kaikova
,
V. Terziyan
,
B. Omelayenko
IRMA Conference
2000
Corpus ID: 8371616
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing…
Expand
1999
1999
Ò Ae Blockin Blockin Blockinòø Óó×øøòò Ððóööøøñ Óö Óñòòòò Èööööööò Blockin Blockin×
Raj Dharmarajan
,
David R Karger
,
Arthur C. Smith
1999
Corpus ID: 7712524
1992
1992
THE WEIGHTED MAJORITY ALGORITHM (Supersedes 89-16)
N. Littlestone
,
Manfred K. Warmuth
1992
Corpus ID: 58825028
We study the construction of prediction algorithms in a situation in which a learner faces a sequence of trials, with a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE