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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We show how well known rules of back propagation arise from a weighted combination of finite automata. By redefining a finite…

2016

The classification task in dynamical environments is challenging. A reason for this is the change of their statistical properties…

2016

Previously, we introduced the best-expert problem, and we proved a O(ln K) mistake bound for the majority vote algorithm when a…

2016

Learning with expert advice as a scheme of on-line learning has been very successfully applied to various learning problems due…

2013

Lecture 1 ended by studying the problem of predicting the outcomes of games played among k teams, where a game between two of…

2007

A trustworthiness-based ad-hoc secure interoperation method is proposed, in which the concept of trustworthiness is introduced to…

2005

We previously developed a trust model in which an entity makes decisions in online interactions by using past behavior as a…

2000

The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing…

1999

1992

We study the construction of prediction algorithms in a situation in which a learner faces a sequence of trials, with a…