scispace - formally typeset
Journal ArticleDOI

Note on discrimination information and variation (Corresp.)

I. Vajda
- 01 Nov 1970 - 
- Vol. 16, Iss: 6, pp 771-773
Reads0
Chats0
About
This article is published in IEEE Transactions on Information Theory.The article was published on 1970-11-01. It has received 95 citations till now. The article focuses on the topics: Variation (linguistics).

read more

Citations
More filters
Journal ArticleDOI

Divergence measures based on the Shannon entropy

TL;DR: A novel class of information-theoretic divergence measures based on the Shannon entropy is introduced, which do not require the condition of absolute continuity to be satisfied by the probability distributions involved and are established in terms of bounds.
Journal ArticleDOI

Some inequalities for information divergence and related measures of discrimination

TL;DR: This study depends on two measures of discrimination, called capacitory discrimination and triangular discrimination, and obtains certain improvements of the well-known Pinsker inequality.
Journal ArticleDOI

Patterns in pattern recognition: 1968-1974

TL;DR: This paper selectively surveys contributions to major topics in pattern recognition since 1968, including contributions to error estimation and the experimental design of pattern classifiers.
Journal ArticleDOI

$f$ -Divergence Inequalities

TL;DR: In this paper, the Renyi divergence in terms of the relative information spectrum is derived, leading to a bound on the total variation distance and its relation to the relative entropy, including reverse Pinsker inequalities.
Journal ArticleDOI

Information, Divergence and Risk for Binary Experiments

TL;DR: The new viewpoint also illuminates existing algorithms: it provides a new derivation of Support Vector Machines in terms of divergences and relates maximum mean discrepancy to Fisher linear discriminants.
References
More filters
Journal ArticleDOI

Some Limit Theorems for Random Functions. II

TL;DR: In this article, the convergence of the distribution of the number of intersections of a high level to a Poisson point is studied, and a theorem is proved that the convergence is tight.
Journal ArticleDOI

A note on exponential bounds for binomial probabilities

TL;DR: For most of the values (p, c) for which the argument of symmetry does not go through, the inequality can be sharpened considerably as discussed by the authors and it may be remarked that values c>=l-p are of no interest for the considered problem and that the right-hand side of (1) should be independent of p.
Related Papers (5)