Tutorial series on brain-inspired computing. VI: Geometrical structure of boosting algorithm
From MaRDI portal
Publication:857990
DOI10.1007/s00354-006-0006-0zbMath1119.68385MaRDI QIDQ857990
Noboru Murata, Takashi Takenouchi, Takafumi Kanamori
Publication date: 5 January 2007
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00354-006-0006-0
68T05: Learning and adaptive systems in artificial intelligence
Uses Software
Cites Work
- Unnamed Item
- A decision-theoretic generalization of on-line learning and an application to boosting
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Robust Blind Source Separation by Beta Divergence
- Robustifying AdaBoost by Adding the Naive Error Rate
- Information Geometry of U-Boost and Bregman Divergence
- Convexity, Classification, and Risk Bounds