DBpedia – Linked Data Fragments

Matches in DBpedia 2015-10 for { ?s ?p "In probability theory and information theory, the Kullback–Leibler divergence (also information divergence, information gain, relative entropy, KLIC, or KL divergence) is a non-symmetric measure of the difference between two probability distributions P and Q. Specifically, the Kullback–Leibler divergence of Q from P, denoted DKL(P‖Q), is a measure of the information lost when Q is used to approximate P: The Kullback–Leibler divergence measures the expected number of extra bits (so intuitively it is non negative; this can be verified by Jensen's inequality) required to code samples from P when using a code optimized for Q, rather than using the true code optimized for P. Typically P represents the "true" distribution of data, observations, or a precisely calculated theoretical distribution. The measure Q typically represents a theory, model, description, or approximation of P.Although it is often intuited as a metric or distance, the Kullback–Leibler divergence is not a true metric — for example, it is not symmetric: the Kullback–Leibler divergence from P to Q is generally not the same as that from Q to P. However, its infinitesimal form, specifically its Hessian, is a metric tensor: it is the Fisher information metric.Kullback–Leibler divergence is a special case of a broader class of divergences called f-divergences.It was originally introduced by Solomon Kullback and Richard Leibler in 1951 as the directed divergence between two distributions.It can be derived from a Bregman divergence."@en }

• Kullback–Leibler_divergence abstract "In probability theory and information theory, the Kullback–Leibler divergence (also information divergence, information gain, relative entropy, KLIC, or KL divergence) is a non-symmetric measure of the difference between two probability distributions P and Q. Specifically, the Kullback–Leibler divergence of Q from P, denoted DKL(P‖Q), is a measure of the information lost when Q is used to approximate P: The Kullback–Leibler divergence measures the expected number of extra bits (so intuitively it is non negative; this can be verified by Jensen's inequality) required to code samples from P when using a code optimized for Q, rather than using the true code optimized for P. Typically P represents the "true" distribution of data, observations, or a precisely calculated theoretical distribution. The measure Q typically represents a theory, model, description, or approximation of P.Although it is often intuited as a metric or distance, the Kullback–Leibler divergence is not a true metric — for example, it is not symmetric: the Kullback–Leibler divergence from P to Q is generally not the same as that from Q to P. However, its infinitesimal form, specifically its Hessian, is a metric tensor: it is the Fisher information metric.Kullback–Leibler divergence is a special case of a broader class of divergences called f-divergences.It was originally introduced by Solomon Kullback and Richard Leibler in 1951 as the directed divergence between two distributions.It can be derived from a Bregman divergence.".