Bhattacharyya coefficient
E753440
The Bhattacharyya coefficient is a statistical measure of similarity between two probability distributions, often used to quantify their overlap in fields like pattern recognition and signal processing.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Bhattacharyya coefficient canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T8728970 — 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 coefficient Context triple: [Bhattacharyya distance, relatedConcept, Bhattacharyya coefficient]
-
A.
Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
-
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.
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.
-
D.
Tsallis divergence
Tsallis divergence is a generalized measure of statistical distance between probability distributions derived from Tsallis entropy, often used in nonextensive statistical mechanics and information theory.
-
E.
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.
- 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 coefficient Target entity description: The Bhattacharyya coefficient is a statistical measure of similarity between two probability distributions, often used to quantify their overlap in fields like pattern recognition and signal processing.
-
A.
Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
-
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.
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.
-
D.
Tsallis divergence
Tsallis divergence is a generalized measure of statistical distance between probability distributions derived from Tsallis entropy, often used in nonextensive statistical mechanics and information theory.
-
E.
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.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
distance and similarity measure
ⓘ
probability theory concept ⓘ statistical similarity measure ⓘ |
| appliesTo |
continuous probability distributions
ⓘ
discrete probability distributions ⓘ multivariate probability distributions ⓘ |
| category |
information-theoretic measures
ⓘ
pattern recognition metrics ⓘ statistical distance and similarity measures ⓘ |
| comparedWith |
Jensen–Shannon divergence
ⓘ
total variation distance ⓘ |
| definedOver |
probability density functions
ⓘ
probability mass functions ⓘ |
| field |
information theory
ⓘ
machine learning ⓘ pattern recognition ⓘ probability theory ⓘ signal processing ⓘ statistics ⓘ |
| hasInverseMeasure | Bhattacharyya distance ⓘ |
| hasProperty |
bounded between 0 and 1
ⓘ
equals 0 when the supports of the distributions do not overlap ⓘ equals 1 when the two distributions are identical ⓘ symmetric in its two arguments ⓘ |
| introducedBy | Anil Kumar Bhattacharyya ⓘ |
| measures |
overlap between two probability distributions
ⓘ
similarity between two probability distributions ⓘ |
| namedAfter | Anil Kumar Bhattacharyya ⓘ |
| relatedTo |
Bhattacharyya distance
ⓘ
Hellinger distance ⓘ Kullback–Leibler divergence ⓘ Mahalanobis distance ⓘ |
| usedFor |
feature selection
ⓘ
hypothesis testing ⓘ image processing ⓘ measuring similarity between histograms ⓘ pattern classification ⓘ quantifying class separability ⓘ signal detection ⓘ template matching in computer vision ⓘ tracking objects in video sequences ⓘ |
| usedIn |
Bayesian classification
ⓘ
linked to:
Bayesian inference
bioinformatics ⓘ financial risk modeling ⓘ medical image analysis ⓘ remote sensing ⓘ speech recognition ⓘ texture analysis ⓘ |
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 coefficient Description of subject: The Bhattacharyya coefficient is a statistical measure of similarity between two probability distributions, often used to quantify their overlap in fields like pattern recognition and signal processing.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.