Learning binary relations using weighted majority voting
Learning binary relations using weighted majority voting
Learning binary relations using weighted majority voting
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
252 GOLDMAN AND WARMUTH<br />
the learning problem among themselves. Assume M~j is the next value to predict. To<br />
make its prediction, the node for row r combines the votes of the n - 1 inputs from<br />
column j of matrix M. Each node r ~ ¢ r votes with the weight w(er