Constraints in Weighted Averaging

Authors:
Amber Tomas
Affiliations:
Department of Statistics, The University of Oxford, Oxford, United Kingdom OX2 3TG
Venue:
MCS '09 Proceedings of the 8th International Workshop on Multiple Classifier Systems
Year:
2009

Citing 2
Cited 1

Margin Trees for High-dimensional Classification

The Journal of Machine Learning Research
Solving multiclass learning problems via error-correcting output codes

Journal of Artificial Intelligence Research

Combining classifiers by particle swarms with local search

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weighted averaging of classifier outputs is used in many MCSs, yet is still not well understood. Several empirical studies have investigated the effect that non-negativity and sum-one constraints have on the error rate of weighted averaging rules, but there is little theory available to understand the results. In this paper we study how constraints on the weights affect the location of the decision boundary of a MCS using weighted averaging. This allows us to explain many of the empirical findings, and suggest guidelines for when the application of constraints may or may not be appropriate. We also consider how these results relate to the analytical framework first proposed by Tumer and Ghosh [5].