The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The Burbea-Rao and Bhattacharyya Centroids
Open accessAbstract
We study the centroid with respect to the class of information-theoretic Burbea-Rao divergences that generalize the celebrated Jensen-Shannon divergence by measuring the non-negative Jensen difference induced by a strictly convex and differentiable function. Although those Burbea-Rao divergences are symmetric by construction, they are not metric since they fail to satisfy the triangle inequality. We first explain how a particular symmetrization of Bregman divergences called Jensen-Bregman distances yields exactly those Burbea-Rao divergences. We then proceed by defining skew Burbea-Rao divergences, and show that skew Burbea-Rao divergences amount in limit cases to compute Bregman divergences. We then prove that Burbea-Rao centroids can be arbitrarily finely approximated by a generic iterative concave-convex optimization algorithm with guaranteed convergence property. In the second part of the paper, we consider the Bhattacharyya distance that is commonly used to measure overlapping degree of probability distributions. We show that Bhattacharyya distances on members of the same statistical exponential family amount to calculate a Burbea-Rao divergence in disguise. Thus we get an efficient algorithm for computing the Bhattacharyya centroid of a set of parametric distributions belonging to the same exponential families, improving over former specialized methods found in the literature that were limited to univariate or “diagonal” multivariate Gaussians. To illustrate the performance of our Bhattacharyya/Burbea-Rao centroid algorithm, we present experimental performance results fork-means and hierarchical clustering methods of Gaussian mixture models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Yuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151 · cited 2×
“We can thus solve iteratively this optimization problem using the Convex-ConCave Procedure [32], [33] (CCCP), by starting from an initial position (say, the barycenter ), and iteratively update the barycenter as follows:”
MethodOn equivalence of infinite product measures
Kakutani, S. (1948) · The Annals of Mathematics · doi:10.2307/1969123 · Cited by 424
Cited by
A new similarity measure using Bhattacharyya coefficient for collaborative filtering in sparse data
Patra, B. K., Launonen, R., Ollikainen, V., & Nandi, S. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.03.001 · Cited by 269
On the Jensen–Shannon Symmetrization of Distances Relying on Abstract Means
Nielsen, F. (2019) · Entropy · doi:10.3390/e21050485 · Cited by 257
“Similar to the interpretation of the Jensen-Shannon divergence (statistical divergence) as a Jensen divergence for the negentropy generator, the Jensen-Bregman divergence [37] JBF (parametric divergence JBD) amounts to a Jensen divergence JF for a strictly convex generator F : Θ → R: JBF (θ : θ ′) := 1 2 (”
BackgroundMethodResultInfluentialSelf-citation
Metadata
- Authors
- Nielsen, F., & Boltz, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-08
- Volume
- 57
- Issue
- 8
- Pages
- 5455-5466
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2162995444
- Cited by
- 161
- References
- 2
- FWCI
- 9.17
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Burbea-Rao and Bhattacharyya Centroids. https://app.cochat.ai/papers/10.1109/tit.2011.2159046
- The paper
- Nielsen, F., & Boltz, S. (2011). The Burbea-Rao and Bhattacharyya Centroids. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2159046
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.