Meaningful information

IEEE Transactions on Information Theory

Volumn 52, Issue 10, 2006, Pages 4617-4626

  Vitányi, Paul M ^a  

^a CWI   (Netherlands)

Author keywords

Computability; Constrained best fit model selection; Kolmogorov complexity; Kolmogorov structure function; Lossy compression; Minimal sufficient statistic; Nonprobabilistic statistics; Sophistication; Sufficient statistic

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBABILITY; STATISTICAL METHODS;

CONSTRAINED BEST FIT MODEL SELECTION; KOLMOGOROV COMPLEXITY; KOLMOGOROV STRUCTURE FUNCTION; LOSSY COMPRESSION; MINIMAL SUFFICIENT STATISTIC; NONPROBABILISTIC STATISTICS; SUFFICIENT STATISTIC;

INFORMATION THEORY;

EID: 33947422405     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.881729     Document Type: Article

References (25)

1. A. R. Barron, J. Rissanen, and B. Yu, "The minimum description length principle in coding and modeling," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2743-2760, Oct. 1998.
2. T. M. Cover, "Kolmogorov complexity, data compression, and inference," in The Impact of Processing Techniques on Communications, J. K. Skwirzynski, Ed. Dordrecht, The Netherlands: Martinus Nijhoff, 1985, pp. 23-33.
3. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
4. R. A. Fisher, "On the mathematical foundations of theoretical statistics," Phil. Tran. Roy. Soc. London, Ser. A, vol. 222, pp. 309-368, 1922.
5. P. Gács, "On the symmetry of algorithmic information," Sov.Math. - Dokl., vol. 15, pp. 1477-1480, 1974.
6. P. Gács, J. Tromp, and P. Vitányi, "Algorithmic statistics," IEEE Trans. Inf. Theory; vol. 47, no. 6, pp. 2443-2463, Sep. 2001.
7. Q. Gao, M. Li, and P. M. B. Vitányi, "Applying MDL to learn best model granularity," Artificial Intell., vol. 121, pp. 1-29, 2000.
8. M. Gell-Mann, The Quark and the Jaguar. New York: Freeman, 1994.
9. P. D. Grünwald and P. M. B. Vitányi, Shannon Information and Kolmogorov Complexity. CWI, Amsterdam, The Netherlands, 2003, unpublished manuscript.
10. A. N. Kolmogorov, "Three approaches to the quantitative definition of information," Probl. Inf. Transm., vol. I, no. 1, pp. 1-7, 1965.
11. _, "Complexity of algorithms and objective definition of randomness," presented at the Moscow Math. Soc. Meeting 4/16/1974, English translation in [21].
12. _, "On logical foundations of probability theory," in Probability Theory and Mathematical Statistics (Lecture Notes in Mathematics) K. Itô and Y. V. Prokhorov, Eds. Heidelberg, Germany: Springer-Verlag, 1983, vol. 1021, pp. 1-5.
13. A.N. Kolmogorov and V. A. Uspensky, "Algorithms and randomness," SIAM Theory Probab. Appl., vol. 32, no. 3, pp. 389-412, 1988.
14. M. Koppel, "Complexity, depth, and sophistication," Complex Syst., vol. 1, pp. 1087-1091, 1987.
15. _, "Structure," in The Universal Turing Machine: A Half-Century SurveyR. Herken, Ed. Oxford, U.K.: Oxford Univ. Press, 1988, pp. 435-152.
16. M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed. New York: Springer-Verlag, 1997.
17. C. E. Shannon, "The mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 623-656, 1948.
18. _, "Coding theorems for a discrete source with a fidelity criterion," in IRE Nat. Conv: Rec., Pt. 4, 1959, pp. 142-163.
19. A. K. Shen, "The concept of (α, β)-stochasticity in the Kolmogorov sense, and its properties," Sov: Math. - Dokl., vol. 28, no. 1, pp. 295-299, 1983.
20. _, "Discussion on Kolmogorov complexity and statistical analysis," Comput. J., vol. 42, no. 4, pp. 340-342, 1999.
21. N. K. Vereshchagin and P. M. B. Vitányi, "Kolmogorov's structure functions and model selection," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3265-3290, Dec. 2004.
22. _, "Arithmetic rate-distortion theory," IEEE Trans. Inf. Theory, submitted for publication.
23. P. M. B. Vitányi and M. Li, "Minimum description length induction, Bayesianism, and Kolmogorov complexity," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 446-464, Mar. 2000.
24. V. V. V'yugin, "On the defect of randomness of a finite object with respect to measures with given complexity bounds," SIAM Theory Probab. Appl., vol. 32, no. 3, pp. 508-512, 1987.
25. _, "Algorithmic complexity and stochastic properties of finite binary sequences," Comput. J., vol. 42, no. 4, pp. 294-317, 1999.