Logo

Information Theory, Inference, and Learning Algorithms

Large book cover: Information Theory, Inference, and Learning Algorithms

Information Theory, Inference, and Learning Algorithms
by

Publisher: Cambridge University Press
ISBN/ASIN: 0521642981
ISBN-13: 9780521642989
Number of pages: 640

Description:
Information theory and inference, often taught separately, are here united in one entertaining textbook. These topics lie at the heart of many exciting areas of contemporary science and engineering - communication, signal processing, data mining, machine learning, pattern recognition, computational neuroscience, bioinformatics, and cryptography. This textbook introduces theory in tandem with applications. Information theory is taught alongside practical communication systems, such as arithmetic coding for data compression and sparse-graph codes for error-correction. A toolbox of inference techniques, including message-passing algorithms, Monte Carlo methods, and variational approximations, are developed alongside applications of these tools to clustering, convolutional codes, independent component analysis, and neural networks.

Home page url

Download or read it online for free here:
Download link
(multiple formats)

Similar books

Book cover: From Classical to Quantum Shannon TheoryFrom Classical to Quantum Shannon Theory
by - arXiv
The aim of this book is to develop 'from the ground up' many of the major developments in quantum Shannon theory. We study quantum mechanics for quantum information theory, we give important unit protocols of teleportation, super-dense coding, etc.
(11166 views)
Book cover: Essential Coding TheoryEssential Coding Theory
by - University at Buffalo
Error-correcting codes are clever ways of representing data so that one can recover the original information even if parts of it are corrupted. The basic idea is to introduce redundancy so that the original information can be recovered ...
(9403 views)
Book cover: Around Kolmogorov Complexity: Basic Notions and ResultsAround Kolmogorov Complexity: Basic Notions and Results
by - arXiv.org
Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.
(6590 views)
Book cover: Information Theory and Statistical PhysicsInformation Theory and Statistical Physics
by - arXiv
Lecture notes for a graduate course focusing on the relations between Information Theory and Statistical Physics. The course is aimed at EE graduate students in the area of Communications and Information Theory, or graduate students in Physics.
(12899 views)