Hybrid classification algorithms based on boosting and support vector machines

DOI10.1108/03684920810907814zbMath1185.68550DBLPjournals/kybernetes/MaiaBC08OpenAlexW2036169229WikidataQ57739951 ScholiaQ57739951MaRDI QIDQ3639375

Antônio Pádua Braga, Thiago Turchetti Maia, André F. de Carvalho

Publication date: 30 October 2009

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684920810907814

zbMATH Keywords

optimization techniquescyberneticsprogramming and algorithm theory

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Uses Software

• AdaBoost.MH

Cites Work

• Equivalence of models for polynomial learnability
• A decision-theoretic generalization of on-line learning and an application to boosting
• Boosting a weak learning algorithm by majority
• Improved boosting algorithms using confidence-rated predictions
• A theory of the learnable
• Cryptographic limitations on learning Boolean formulae and finite automata

This page was built for publication: Hybrid classification algorithms based on boosting and support vector machines