Bhattacharyya distance
E207203
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Bhattacharyya distance canonical | 3 |
| Bhattacharyya bound | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1836110 — 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: Bhattacharyya distance Context triple: [Rényi divergence, relatedTo, Bhattacharyya distance]
-
A.
Hellinger 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.
-
B.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
C.
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.
-
D.
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 α.
-
E.
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.
- 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: Bhattacharyya distance Target entity description: Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
-
A.
Hellinger 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.
-
B.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
C.
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.
-
D.
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 α.
-
E.
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.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
divergence measure
ⓘ
similarity measure ⓘ statistical distance ⓘ |
| appliesTo |
continuous probability distributions
ⓘ
discrete probability distributions ⓘ |
| approximation | can be approximated by a quadratic form for close distributions ⓘ |
| category |
distance between probability distributions
ⓘ
statistical similarity measure ⓘ |
| definedFrom | Bhattacharyya coefficient ⓘ |
| domain | probability distributions ⓘ |
| field |
information theory
ⓘ
machine learning ⓘ pattern recognition ⓘ signal processing ⓘ statistics ⓘ |
| input |
first probability distribution
ⓘ
second probability distribution ⓘ |
| introducedBy | Anil Kumar Bhattacharyya ⓘ |
| introducedIn | 1943 ⓘ |
| mathematicalDefinition |
BC(p,q) = sum_i sqrt(p_i q_i) for discrete distributions
ⓘ
BC(p,q) = ∫ sqrt(p(x) q(x)) dx for continuous distributions ⓘ D_B(p,q) = -ln(BC(p,q)) ⓘ |
| namedAfter | Anil Kumar Bhattacharyya ⓘ |
| notProperty | metric in the strict mathematical sense ⓘ |
| output | nonnegative real number ⓘ |
| property |
equals zero if and only if the two distributions are identical almost everywhere
ⓘ
larger values indicate less overlap between distributions ⓘ symmetric in its two arguments ⓘ |
| reasonNotMetric | does not generally satisfy the triangle inequality ⓘ |
| relatedConcept | Bhattacharyya coefficient ⓘ |
| relatedTo |
Hellinger distance
ⓘ
Kullback–Leibler divergence ⓘ Mahalanobis distance ⓘ |
| specialCase | reduces to a function of mean and covariance for multivariate normal distributions ⓘ |
| usedFor |
classification
ⓘ
feature selection ⓘ hypothesis testing ⓘ image processing ⓘ measuring similarity between probability distributions ⓘ pattern recognition ⓘ quantifying overlap between probability distributions ⓘ |
| usedIn |
Bayesian inference
ⓘ
surface form:
Bayesian decision theory
Gaussian classification ⓘ bioinformatics ⓘ image segmentation ⓘ object tracking ⓘ remote sensing ⓘ speech recognition ⓘ |
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: Bhattacharyya distance Description of subject: Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Bhattacharyya bound