Boosting: Foundations and Algorithms
by Robert E. Schapire, Yoav Freund
Publisher: The MIT Press 2014
Number of pages: 544
Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate 'rules of thumb'. A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry.
Home page url
Download or read it online for free here:
by Titus Neupert, et al. - arXiv.org
This is an introductory machine learning course specifically developed with STEM students in mind, written by the theoretical Condensed Matter Theory group at the University of Zurich. We discuss supervised, unsupervised, and reinforcement learning.
by Stephen Muggleton, Luc de Raedt - ScienceDirect
Inductive Logic Programming is a new discipline which investigates the inductive construction of first-order clausal theories from examples and background knowledge. The authors survey the most important theories and methods of this new field.
by Max Welling - University of California Irvine
The book you see before you is meant for those starting out in the field of machine learning, who need a simple, intuitive explanation of some of the most useful algorithms that our field has to offer. A prelude to the more advanced text books.
by Jonas Buchli, et al. - arXiv.org
The starting point is the formulation of of an optimal control problem and deriving the different types of solutions and algorithms from there. These lecture notes aim at supporting this unified view with a unified notation wherever possible.