Shedding Light on the Asymmetric Learning Capability of AdaBoost

07/08/2015
by   Iago Landesa-Vázquez, et al.
0

In this paper, we propose a different insight to analyze AdaBoost. This analysis reveals that, beyond some preconceptions, AdaBoost can be directly used as an asymmetric learning algorithm, preserving all its theoretical properties. A novel class-conditional description of AdaBoost, which models the actual asymmetric behavior of the algorithm, is presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2019

On Asymmetric Unification for the Theory of XOR with a Homomorphism

Asymmetric unification, or unification with irreducibility constraints, ...
research
08/09/2022

Asymmetric Metrics on the Full Grassmannian of Subspaces of Different Dimensions

Metrics on Grassmannians have a wide array of applications: machine lear...
research
10/10/2022

Centre-free kurtosis orderings for asymmetric distributions

The concept of kurtosis is used to describe and compare theoretical and ...
research
05/19/2020

Asymmetric scale functions for t-digests

The t-digest is a data structure that can be queried for approximate qua...
research
07/08/2015

Double-Base Asymmetric AdaBoost

Based on the use of different exponential bases to define class-dependen...
research
02/03/2022

Learning with Asymmetric Kernels: Least Squares and Feature Interpretation

Asymmetric kernels naturally exist in real life, e.g., for conditional p...
research
05/18/2022

Internet Performance in the 2022 Conflict in Ukraine: An Asymmetric Analysis

On 24 February 2022 Russia invaded Ukraine, starting one of the largest ...

Please sign up or login with your details

Forgot password? Click here to reset