Résumé
In information theory, joint entropy is a measure of the uncertainty associated with a set of variables. The joint Shannon entropy (in bits) of two discrete random variables and with images and is defined as where and are particular values of and , respectively, is the joint probability of these values occurring together, and is defined to be 0 if . For more than two random variables this expands to where are particular values of , respectively, is the probability of these values occurring together, and is defined to be 0 if . The joint entropy of a set of random variables is a nonnegative number. 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. 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 and are statistically independent. Joint entropy is used in the definition of conditional entropy and It is also used in the definition of mutual information 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 and be a continuous random variables with a joint probability density function . The differential joint entropy is defined as For more than two continuous random variables the definition is generalized to: The integral is taken over the support of . 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: The following chain rule holds for two random variables: In the case of m
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.