Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.wikipedia.org/wiki/Joint_entropy below:

Joint entropy - Wikipedia

From Wikipedia, the free encyclopedia

Measure of information in probability and information theory

In information theory, joint entropy is a measure of the uncertainty associated with a set of variables.^[1]

The joint Shannon entropy (in bits) of two discrete random variables X {\displaystyle X} and Y {\displaystyle Y} with images X {\displaystyle {\mathcal {X}}} and Y {\displaystyle {\mathcal {Y}}} is defined as^[2]: 16

H ( X , Y ) = − ∑ x ∈ X ∑ y ∈ Y P ( x , y ) log 2 ⁡ [ P ( x , y ) ] {\displaystyle \mathrm {H} (X,Y)=-\sum _{x\in {\mathcal {X}}}\sum _{y\in {\mathcal {Y}}}P(x,y)\log _{2}[P(x,y)]}

where x {\displaystyle x} and y {\displaystyle y} are particular values of X {\displaystyle X} and Y {\displaystyle Y} , respectively, P ( x , y ) {\displaystyle P(x,y)} is the joint probability of these values occurring together, and P ( x , y ) log 2 ⁡ [ P ( x , y ) ] {\displaystyle P(x,y)\log _{2}[P(x,y)]} is defined to be 0 if P ( x , y ) = 0 {\displaystyle P(x,y)=0} .

For more than two random variables X 1 , . . . , X n {\displaystyle X_{1},...,X_{n}} this expands to

H ( X 1 , . . . , X n ) = − ∑ x 1 ∈ X 1 . . . ∑ x n ∈ X n P ( x 1 , . . . , x n ) log 2 ⁡ [ P ( x 1 , . . . , x n ) ] {\displaystyle \mathrm {H} (X_{1},...,X_{n})=-\sum _{x_{1}\in {\mathcal {X}}_{1}}...\sum _{x_{n}\in {\mathcal {X}}_{n}}P(x_{1},...,x_{n})\log _{2}[P(x_{1},...,x_{n})]}

where x 1 , . . . , x n {\displaystyle x_{1},...,x_{n}} are particular values of X 1 , . . . , X n {\displaystyle X_{1},...,X_{n}} , respectively, P ( x 1 , . . . , x n ) {\displaystyle P(x_{1},...,x_{n})} is the probability of these values occurring together, and P ( x 1 , . . . , x n ) log 2 ⁡ [ P ( x 1 , . . . , x n ) ] {\displaystyle P(x_{1},...,x_{n})\log _{2}[P(x_{1},...,x_{n})]} is defined to be 0 if P ( x 1 , . . . , x n ) = 0 {\displaystyle P(x_{1},...,x_{n})=0} .

The joint entropy of a set of random variables is a nonnegative number.

H ( X , Y ) ≥ 0 {\displaystyle \mathrm {H} (X,Y)\geq 0}

H ( X 1 , … , X n ) ≥ 0 {\displaystyle \mathrm {H} (X_{1},\ldots ,X_{n})\geq 0}

The joint entropy of a set of variables is greater than or equal to the maximum of all of the individual entropies of the variables in the set.

H ( X , Y ) ≥ max [ H ( X ) , H ( Y ) ] {\displaystyle \mathrm {H} (X,Y)\geq \max \left[\mathrm {H} (X),\mathrm {H} (Y)\right]}

H ( X 1 , … , X n ) ≥ max 1 ≤ i ≤ n { H ( X i ) } {\displaystyle \mathrm {H} {\bigl (}X_{1},\ldots ,X_{n}{\bigr )}\geq \max _{1\leq i\leq n}{\Bigl \{}\mathrm {H} {\bigl (}X_{i}{\bigr )}{\Bigr \}}}

The joint entropy of a set of variables is less than or equal to the sum of the individual entropies of the variables in the set. This is an example of subadditivity. This inequality is an equality if and only if X {\displaystyle X} and Y {\displaystyle Y} are statistically independent.^[2]: 30

H ( X , Y ) ≤ H ( X ) + H ( Y ) {\displaystyle \mathrm {H} (X,Y)\leq \mathrm {H} (X)+\mathrm {H} (Y)}

H ( X 1 , … , X n ) ≤ H ( X 1 ) + … + H ( X n ) {\displaystyle \mathrm {H} (X_{1},\ldots ,X_{n})\leq \mathrm {H} (X_{1})+\ldots +\mathrm {H} (X_{n})}

Joint entropy is used in the definition of conditional entropy^[2]: 22

H ( X | Y ) = H ( X , Y ) − H ( Y ) {\displaystyle \mathrm {H} (X|Y)=\mathrm {H} (X,Y)-\mathrm {H} (Y)\,} ,

and

H ( X 1 , … , X n ) = ∑ k = 1 n H ( X k | X k − 1 , … , X 1 ) {\displaystyle \mathrm {H} (X_{1},\dots ,X_{n})=\sum _{k=1}^{n}\mathrm {H} (X_{k}|X_{k-1},\dots ,X_{1})} .

For two variables X {\displaystyle X} and Y {\displaystyle Y} , this means that

H ( X , Y ) = H ( Y ) + H ( X | Y ) = H ( X ) + H ( Y | X ) {\displaystyle \mathrm {H} (X,Y)=\mathrm {H} (Y)+\mathrm {H} (X|Y)=\mathrm {H} (X)+\mathrm {H} (Y|X)} .

Joint entropy is also used in the definition of mutual information^[2]: 21

I ⁡ ( X ; Y ) = H ( X ) + H ( Y ) − H ( X , Y ) {\displaystyle \operatorname {I} (X;Y)=\mathrm {H} (X)+\mathrm {H} (Y)-\mathrm {H} (X,Y)\,} .

In quantum information theory, the joint entropy is generalized into the joint quantum entropy.

The above definition is for discrete random variables and just as valid in the case of continuous random variables. The continuous version of discrete joint entropy is called joint differential (or continuous) entropy. Let X {\displaystyle X} and Y {\displaystyle Y} be a continuous random variables with a joint probability density function f ( x , y ) {\displaystyle f(x,y)} . The differential joint entropy h ( X , Y ) {\displaystyle h(X,Y)} is defined as^[2]: 249

h ( X , Y ) = − ∫ X , Y f ( x , y ) log ⁡ f ( x , y ) d x d y {\displaystyle h(X,Y)=-\int _{{\mathcal {X}},{\mathcal {Y}}}f(x,y)\log f(x,y)\,dxdy}

For more than two continuous random variables X 1 , . . . , X n {\displaystyle X_{1},...,X_{n}} the definition is generalized to:

h ( X 1 , … , X n ) = − ∫ f ( x 1 , … , x n ) log ⁡ f ( x 1 , … , x n ) d x 1 … d x n {\displaystyle h(X_{1},\ldots ,X_{n})=-\int f(x_{1},\ldots ,x_{n})\log f(x_{1},\ldots ,x_{n})\,dx_{1}\ldots dx_{n}}

The integral is taken over the support of f {\displaystyle f} . It is possible that the integral does not exist in which case we say that the differential entropy is not defined.

As in the discrete case the joint differential entropy of a set of random variables is smaller or equal than the sum of the entropies of the individual random variables:

h ( X 1 , X 2 , … , X n ) ≤ ∑ i = 1 n h ( X i ) {\displaystyle h(X_{1},X_{2},\ldots ,X_{n})\leq \sum _{i=1}^{n}h(X_{i})} ^[2]: 253

The following chain rule holds for two random variables:

h ( X , Y ) = h ( X | Y ) + h ( Y ) {\displaystyle h(X,Y)=h(X|Y)+h(Y)}

In the case of more than two random variables this generalizes to:^[2]: 253

h ( X 1 , X 2 , … , X n ) = ∑ i = 1 n h ( X i | X 1 , X 2 , … , X i − 1 ) {\displaystyle h(X_{1},X_{2},\ldots ,X_{n})=\sum _{i=1}^{n}h(X_{i}|X_{1},X_{2},\ldots ,X_{i-1})}

Joint differential entropy is also used in the definition of the mutual information between continuous random variables:

I ⁡ ( X , Y ) = h ( X ) + h ( Y ) − h ( X , Y ) {\displaystyle \operatorname {I} (X,Y)=h(X)+h(Y)-h(X,Y)}

1. ^ Theresa M. Korn; Korn, Granino Arthur (January 2000). Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review. New York: Dover Publications. ISBN 0-486-41147-8.
2. ^ ^{a b c d e f g} Thomas M. Cover; Joy A. Thomas (18 July 2006). Elements of Information Theory. Hoboken, New Jersey: Wiley. ISBN 0-471-24195-4.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4