Hellinger distance
E205229
divergence measure
f-divergence
information geometry concept
probability theory concept
statistical distance
Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Hellinger distance canonical | 6 |
| Hellinger metric | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1836109 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hellinger distance Context triple: [Rényi divergence, relatedTo, Hellinger distance]
-
A.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
B.
Kolmogorov distance
Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
-
C.
Rényi divergence
Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
-
D.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
-
E.
Shannon entropy
Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hellinger distance Target entity description: Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
-
A.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
B.
Kolmogorov distance
Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
-
C.
Rényi divergence
Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
-
D.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
-
E.
Shannon entropy
Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
divergence measure
ⓘ
f-divergence ⓘ information geometry concept ⓘ probability theory concept ⓘ statistical distance ⓘ |
| alternativeForm |
Hellinger metric
ⓘ
linked to:
Hellinger distance
|
| basedOn |
Euclidean distance
ⓘ
square-root densities ⓘ |
| definedOn |
continuous distributions
ⓘ
discrete distributions ⓘ probability distributions ⓘ probability measures ⓘ |
| expressedAs |
L2 distance between square roots of densities
ⓘ
function of Bhattacharyya coefficient ⓘ |
| field |
information geometry
ⓘ
information theory ⓘ machine learning ⓘ probability theory ⓘ statistics ⓘ |
| hasProperty |
bounded between 0 and 1
ⓘ
equals zero if and only if distributions are identical ⓘ metric on space of probability measures ⓘ non-negative ⓘ satisfies triangle inequality ⓘ symmetric ⓘ |
| invariantUnder | measure-preserving transformations ⓘ |
| namedAfter | Ernst Hellinger ⓘ |
| relatedTo |
Bhattacharyya coefficient
ⓘ
Bhattacharyya distance ⓘ Fisher–Rao metric ⓘ Jensen–Shannon divergence ⓘ Kullback–Leibler divergence ⓘ Rényi divergence ⓘ total variation distance ⓘ |
| usedFor |
Bayesian nonparametrics
ⓘ
classification in machine learning ⓘ clustering probability distributions ⓘ comparing probability measures ⓘ distributional similarity in NLP ⓘ feature selection ⓘ goodness-of-fit testing ⓘ measuring dissimilarity between probability distributions ⓘ robust statistical inference ⓘ |
| usedIn |
density estimation
ⓘ
distributional clustering ⓘ domain adaptation ⓘ hypothesis testing ⓘ robust estimation ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Hellinger distance Description of subject: Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
Referenced by (7)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Hellinger distance