The Weighted Majority Algorithm Export

@inproceedings{citeulike:238254, abstract = {We study the construction of prediction algorithms in a situation in which a learner faces a sequence of trials, with a prediction to be made in each, and the goal of the learner is to make few mistakes. We are interested in the case that the learner has reason to believe that one of some pool of known algorithms will perform well, but the learner does not know which one. A simple and effective method, based on weighted voting, is introduced for constructing a compound algorithm in such a...}, author = {Littlestone, Nick and Warmuth, Manfred K.}, booktitle = {IEEE Symposium on Foundations of Computer Science}, citeulike-article-id = {238254}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1595}, keywords = {algorithm, majority, weighted}, pages = {256--261}, posted-at = {2005-12-14 19:07:47}, priority = {2}, title = {The Weighted Majority Algorithm}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1595}, year = {1989} }

TY - CONF ID - citeulike:238254 L3 - citeulike-article-id:238254 N2 - We study the construction of prediction algorithms in a situation in which a learner faces a sequence of trials, with a prediction to be made in each, and the goal of the learner is to make few mistakes. We are interested in the case that the learner has reason to believe that one of some pool of known algorithms will perform well, but the learner does not know which one. A simple and effective method, based on weighted voting, is introduced for constructing a compound algorithm in such a... EP - 261 TI - The Weighted Majority Algorithm T2 - IEEE Symposium on Foundations of Computer Science SP - 256 KW - algorithm KW - majority KW - weighted AU - Littlestone, Nick AU - Warmuth, Manfred PY - 1989/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1595 ER -