| Weighted Majority Algorithm |
Article Index for Weighted |
Website Links For Majority |
Information AboutWeighted Majority Algorithm |
| CATEGORIES ABOUT WEIGHTED MAJORITY ALGORITHM | |
| algorithms | |
|
Assume that the problem is a binary decision problem. To construct the compound algorithm, a positive weight is given to each of the algorithms in the pool. The compound algorithm then collects weighted votes from all the algorithms in the pool, and gives the prediction that has a higher vote. If the compound algorithm makes a mistake, the algorithms in the pool that contributed to the wrong predicting will be discounted by a certain ratio β where 0<β<1. It can be shown that the upper bounds on the number of mistakes made in a given sequence of predictions from a pool of algorithms is |
|
|