Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Jacob Burbea

dblp:19/4057 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Information theory · 80% Computational geometry · 20%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › information measures
divergence measures
0.021982
On the convexity of higher order Jensen differences based on entropy functions · IEEE Trans. Inf. Theory 1982
On the convexity of some divergence measures based on entropy functions · IEEE Trans. Inf. Theory 1982
Information theory › information measures › entropy
entropy functions
0.021982
On the convexity of higher order Jensen differences based on entropy functions · IEEE Trans. Inf. Theory 1982
On the convexity of some divergence measures based on entropy functions · IEEE Trans. Inf. Theory 1982
Computational geometry
convexity
0.011982
On the convexity of higher order Jensen differences based on entropy functions · IEEE Trans. Inf. Theory 1982

Methods — techniques the papers use, named apart from their topics

convexity analysis · 0.0
YearPublicationVenuePosition
1982 On the convexity of some divergence measures based on entropy functions
abstract
Three measures of divergence between vectors in a convex set of an-dimensional real vector space are defined in terms of certain types of entropy functions, and their convexity property is studied. Among other results, a classification of the entropies of degree\alphais obtained by the convexity of these measures. These results have applications in information theory and biological studies.
Jacob Burbea, C. R. Rao 0001
IEEE Trans. Inf. Theory1
1982 On the convexity of higher order Jensen differences based on entropy functions
abstract
In an earlier work, the authors introduced a divergence measure, called the first-order Jensen difference, or in short\cal j-divergence, which is based on entropy functions of degree\alpha. This provided a generalization of the measure of mutual information based on Shannon's entropy (corresponding to\alpha = 1). It was shown that the first-order\cal j-divergence is a convex function only when a is restricted to some range. We define higher order Jensen differences and show that they are convex functions only when the underlying entropy function is of degree two. A statistical application requiring the convexity of higher order Jensen differences is indicated.
Jacob Burbea, C. R. Rao 0001
IEEE Trans. Inf. Theory1