Error Probability Exponents of Multiple Hypotheses Testing Illustrations
Abstract
The paper presents an application of multiple hypothesis testing for two Markov sources with virtual example in terms of text categorization problem. Some numerical experiments concerning Markov sources are considered. Our goal is to present numerical illustrations of interdependencies of error probability exponents as a supplementary to our previous theoretical paper [9].
References
L. Birgé, “Vitess maximals de déroissance des erreurs et tests optimaux associes", Z. Wahrsch. Verw. Gebiete, vol. 55, pp. 261-173, 1981.
R.F. Ahlswede and E.A. Haroutunian, “On logarithmically asymptotically optimal testing of hypotheses and identification", Lecture Notes in Computer Science, vol. 4123, “General Theory of Information Transfer and Combinatorics", Springer, pp. 462-478, 2006.
S. Natarajan, “Large deviations, hypotheses testing, and source coding for finite Markov chains", IEEE Trans. Inform. Theory, vol. 31, no. 3, pp. 360-365, 1985.
E.A. Haroutunian, “On asymptotically optimal criteria for Markov chains", (in Russian), First World Congress of Bernoulli Society, section 2, vol. 2, no. 3, pp. 153-156, 1989.
E.A. Haroutunian, “Asymptotically optimal testing of many statistical hypotheses concerning Markov chain", (in Russian), 5-th Intern. Vilnius Conference on Probability Theory and Mathem. Statistics, vol. 1 (A-L), pp. 202-203, 1989.
M. Gutman, “Asymptotically optimal classification for multiple tests with empirically observed statistics", IEEE Trans. Inform. Theory, vol. 35, no.2, March, 401-408, 1989.
E.A. Haroutunian, “Logarithmically asymptotically optimal testing of multiple statistical hypotheses", Problems of Control and Information Theory, vol. 19, no. 5-6, pp. 413-421, 1990.
E.A. Haroutunian and P.M. Hakobyan, “On logarithmically asymptotically optimal hypotheses testing of three distributions for pair of objects", Mathematical Problems of Computer Science, vol. 24, pp. 76-81, 2005.
E.A. Haroutunian and N.M. Grigoryan, “Reliability approach for testing of many distributions for pair of Markov chains", Mathematical Problems of Computer Science, vol. 28, pp. 109-116, 2007.
E.A. Haroutunian, M.E. Haroutunian, and A.N. Harutyunyan, “Reliability Criteria in Information Theory and in Statistical Hypotheses Testing", Foundation and Trends in Comunications and Information Theory, vol. 4, no. 2-3, pp. 97-263, 2008.
I.Csiszár and J.Körner, Information theory: coding theorems for discrete memoryless systems, Academic Press, New York, 1981.
C.E. Shannon, “A Mathematical theory of communication", Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, July, October, 1948.
P.F. Brown, V.J. Della Pietra, P.V. de Souza, J.C. Lai, R.L. Mercer, “Class-based n-gram models of natural language", Computational Linguistics, vol. 18 (4), pp. 467-479, 1992.
L.D. Baker and A.K. McCallum, “Distributional clustering of words for text classification", Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pp. 96-103, 1998.
J.L. Elman, “Finding structure in time", Cognitive Science, vol. 14, 179-211, 1990.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
