
Universal Estimation of Information Measures for Analog Sources
now publishers Inc
1st Edition
Published on 27. May 2009
Book
Paperback/Softback
104 pages
978-1-60198-230-8 (ISBN)
Description
Entropy, mutual information and divergence measure the randomness, dependence and dissimilarity, respectively, of random objects. In addition to their prominent role in information theory, they have found numerous applications, among others, in probability theory statistics, physics, chemistry, molecular biology, ecology, bioinformatics, neuroscience, machine learning, linguistics, and finance. Many of these applications require a universal estimate of information measures which does not assume knowledge of the statistical properties of the observed data. Over the past few decades, several nonparametric algorithms have been proposed to estimate information measures. Universal Estimation of Information Measures for Analog Sources presents a comprehensive survey of universal estimation of information measures for memoryless analog (real-valued or real vector-valued) sources with an emphasis on the estimation of mutual information and divergence and their applications. The book reviews the consistency of the universal algorithms and the corresponding sufficient conditions as well as their speed of convergence. Universal Estimation of Information Measures for Analog Sources provides a comprehensive review of an increasingly important topic in Information Theory. It will be of interest to students, practitioners and researchers working in Information Theory
More details
Series
Language
English
Place of publication
Hanover
United States
Target group
Professional and scholarly
Dimensions
Height: 234 mm
Width: 156 mm
Thickness: 5 mm
Weight
159 gr
ISBN-13
978-1-60198-230-8 (9781601982308)
DOI
10.1561/0100000021
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
1: Introduction 2: Plug-in Algorithms 3: Algorithms Based on Partitioning 4: Algorithms based on k-Nearest-Neighbor Distances 5: Other Algorithms 6: Algorithm Summary and Experiments 7: Sources with Memory References