# zbMATH — the first resource for mathematics

Information-theoretic approach to measurement reduction problems. (English) Zbl 0195.20501

##### MSC:
 62C99 Statistical decision theory 94A15 Information theory (general) 91C05 Measurement theory in the social and behavioral sciences
##### Keywords:
information, communication
Full Text:
##### References:
 [1] I. Csiszár: Eine informationstheoretische Ungleichung und ihre Anwendung auf den Beweis der Ergodizität von Markoffschen Ketten. Publications of the Mathematical Institute of the Hungarian Academy of Sciences VIII (1963), Series A, 85-108. · Zbl 0124.08703 [2] A. Perez: Information, $$\varepsilon$$-Sufficiency and Data Reduction problems. Kybernetika 1 (1965), 4, 297-323. · Zbl 0156.40603 [3] A. Perez: Information Theory Methods in Reducing Complex Decision Problems. Transactions of Fourth Prague Conference on Information Theory (1965), Prague 1967, 55-87. [4] A. Perez: Information-Theoretic Risk Estimates in Statistical Decision. Kybernetika 3 (1967), 1,1-21. · Zbl 0153.48403 [5] A. Perez: Risk Estimates in Terms of Generalized f-Entropies. Proceedings of the Colloquium on Information Theory organized by the Bolyai Mathematical Society, Debrecen, (Hungary) 299-315, 1967. [6] H. Chernoff: A measure of asymptotic efficiency for tests of a hypothesis based on a sum of observations. Ann. Math. Stat. 23 (1952), 4. · Zbl 0048.11804 [7] I. Vajda: On the convergence of informaiotn contained in a sequence of observations. Proceedings of the Colloquium on Information Theory, Debrecen, (Hungary), 1967, 489-501. [8] A. Perez: On the Reducibility of a Set of Statistical Hypotheses. Paper presented at the 37th Session of the International Statistical Institute, London, September 1969.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.