About distances of discrete distributions satisfying the data processing theorem of information theory
From MaRDI portal
Publication:4345633
DOI10.1109/18.605597zbMath0884.94015OpenAlexW2143899172MaRDI QIDQ4345633
L. Vajda, María del Carmen Pardo
Publication date: 10 March 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.605597
Bregman distancedistance of probability measuresCsiszár divergenceBurbea-Rao divergencedata processing theorem
Measures of information, entropy (94A17) Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10)
Related Items (15)
RAO'S STATISTIC FOR THE ANALYSIS OF UNIFORM ASSOCIATION IN CROSS-CLASSIFICATIONS ⋮ A comparison of some estimators of the mixture proportion of mixed normal distributions ⋮ Robust Statistical Engineering by Means of Scaled Bregman Distances ⋮ Unnamed Item ⋮ Nested models for categorical data ⋮ Two approaches to grouping of data and related disparity statistics ⋮ Rao's statistic for constant and proportional hazard models ⋮ Testing stationary distributions of Markov chains based on Rao's divergence ⋮ Improving the accuracy of goodness-of-fit tests based on Rao's divergence with small sample size. ⋮ Unnamed Item ⋮ On Burbea-Rao divergence based goodness-of-fit tests for multinomial models ⋮ Goodness-of-fit tests for stationary distributions of Markov chains based on Rao's divergence ⋮ Goodness-of-fit tests based on Rao's divergence under sparseness assumptions ⋮ Model checking in loglinear models using \(\phi\)-divergences and MLEs ⋮ Optimal transport with some directed distances
This page was built for publication: About distances of discrete distributions satisfying the data processing theorem of information theory
