Lecture Notes in Machine Learning
by Zdravko Markov
Publisher: Central Connecticut State University 2003
Number of pages: 65
Contents: Introduction; Concept learning; Languages for learning; Version space learning; Induction of Decision trees; Covering strategies; Searching the generalization / specialization graph; Inductive Logic Progrogramming; Unsupervised Learning; Explanation-based Learning.
Download or read it online for free here:
by David Barber - Cambridge University Press
The book is designed for final-year undergraduate students with limited background in linear algebra and calculus. Comprehensive and coherent, it develops everything from basics to advanced techniques within the framework of graphical models.
by Richard S. Sutton, Andrew G. Barto - The MIT Press
The book provides a clear and simple account of the key ideas and algorithms of reinforcement learning. It covers the history and the most recent developments and applications. The only necessary mathematical background are concepts of probability.
by Jan-Willem van de Meent, et al. - arXiv.org
This text is designed to be a graduate-level introduction to probabilistic programming. It provides a thorough background for anyone wishing to use a probabilistic programming system, and introduces the techniques needed to build these systems.
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.