Structural online learning

DOI10.1007/978-3-319-46379-7_15MaRDI QIDQ2830279zbMATH OpenOpenAlexFDO

Authors Mehryar Mohri, Scott Yang

Publication date 9 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-46379-7_15

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online learning via sequential complexities
• On the Generalization Ability of On-Line Learning Algorithms
• scientific article; zbMATH DE number 67625
• Online learning algorithms
• Online ensemble learning: An empirical study

Cites work

• 10.1162/153244303321897690
• A decision-theoretic generalization of on-line learning and an application to boosting
• Bagging predictors
• Empirical margin distributions and bounding the generalization error of combined classifiers
• Improved second-order bounds for prediction with expert advice
• On the Generalization Ability of On-Line Learning Algorithms
• Online multiple kernel learning: algorithms and mistake bounds
• Prediction, Learning, and Games
• Soft margins for AdaBoost
• The weighted majority algorithm

Cited in

(3)

• Online ensemble learning: An empirical study
• Online learning via sequential complexities
• Adaptiveness and consistency of a class of online ensemble learning algorithms

Describes a project that uses

Uses Software

• AdaBoost.MH

This page was built for publication: Structural online learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830279)