D:\sbornik\...\Naira.DVI Mathematical Problems of Computer Science 33, 102{110, 2010. E r r or P r obability E xponents of M ultiple H ypotheses T esting I llustr ations N a ir a M. Gr ig o r ya n State Engineering University of Armenia nar.gri@gmail.com 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 numeri- cal illustrations of interdependencies of error probability exponents as a supplementary to our previous theoretical paper [9]. Refer ences [1 ] L . B ir g ¶ e , \ V it e s s m a xim a ls d e d ¶ c r o is s a n c e d e s e r r e u r s e t t e s t s o p t im a u x a s s o c ie s " , Z. W ahrsch. Verw. Gebiete, vo l. 5 5 , p p . 2 6 1 ¡ 1 7 3 , 1 9 8 1 . [2 ] R . F. A h ls we d e a n d E . A . H a r o u t u n ia n , \ On lo g a r it h m ic a lly a s ym p t o t ic a lly o p t im a l t e s t in g o f h yp o t h e s e s a n d id e n t ī c a t io n " , L ecture Notes in Computer Science, vo l. 4 1 2 3 ,\ Ge n e r a lTh e o r y o f In fo r m a t io n Tr a n s fe r a n d Co m b in a t o r ic s " , S p r in g e r , p p . 4 6 2 { 4 7 8 , 2 0 0 6 . [3 ] S . N a t a r a ja n , \ L a r g e d e via t io n s , h yp o t h e s e s t e s t in g , a n d s o u r c e c o d in g fo r ¯ n it e Ma r ko v c h a in s " , IE E E Trans. Inform. Theory, vo l 3 1 , n o . 3 , p p . 3 6 0 -3 6 5 , 1 9 8 5 . [4 ] E . A . H a r o u t u n ia n , \ On a s ym p t o t ic a lly o p t im a l c r it e r ia fo r Ma r ko v c h a in s " , ( in R u s s ia n ) , F irst W orld Congress of B ernoulli Society, s e c t io n 2 , vo l. 2 , n o . 3 , p p . 1 5 3 -1 5 6 , 1 9 8 9 . [5 ] E . A . H a r o u t u n ia n , \ A s ym p t o t ic a lly o p t im a l t e s t in g o f m a n y s t a t is t ic a l h yp o t h e s e s c o n - c e r n in g Ma r ko v c h a in " , ( in R u s s ia n ) , 5-th Intern. Vilnius Conferance on P robability Theory and M athem. Statistics, vo l. 1 ( A -L ) , p p . 2 0 2 -2 0 3 , 1 9 8 9 . [6 ] M. Gu t m a n , \ A s ym p t o t ic a lly o p t im a l c la s s ī c a t io n fo r m u lt ip le t e s t s wit h e m p ir ic a lly o b s e r ve d s t a t is t ic s " , IE E E Tr a n s . In fo r m . Th e o r y, vo l 3 5 , n o 2 , Ma r c h , 4 0 1 -4 0 8 , 1 9 8 9 . [7 ] E . A . H a r o u t u n ia n , \ L o g a r it h m ic a lly a s ym p t o t ic a lly o p t im a l t e s t in g o f m u lt ip le s t a t is - t ic a l h yp o t h e s e s " , P roblems of Control and Information Theory, vo l. 1 9 , n o . 5 -6 , p p . 4 1 3 ¡ 4 2 1 , 1 9 9 0 . [8 ] E . A . H a r o u t u n ia n a n d P . M. H a ko b ya n , \ On lo g a r it h m ic a lly a s ym p t o t ic a lly o p t im a l h yp o t h e s e s t e s t in g o f t h r e e d is t r ib u t io n s fo r p a ir o f o b je c t s " , M athematical P roblems of Computer Science, vo l. 2 4 , p p . 7 6 { 8 1 , 2 0 0 5 . [9 ] E . A . H a r o u t u n ia n a n d N . M. Gr ig o r ya n , \ R e lia b ilit y a p p r o a c h fo r t e s t in g o f m a n y d is - t r ib u t io n s fo r p a ir o f Ma r ko v c h a in s " , M athematical P roblems of Computer Science, vo l. 2 8 , p p . 1 0 9 ¡1 1 6 , 2 0 0 7 . 1 0 2 N. Grigoryan 1 0 3 [1 0 ] E . A . H a r o u t u n ia n , M. E . H a r o u t u n ia n , a n d A . N . H a r u t yu n ya n , \ R e lia b ilit y Cr it e r ia in In fo r m a t io n Th e o r y a n d in S t a t is t ic a l H yp o t h e s e s Te s t in g " , F oundation and Trends in Comunications and Information Theory, vo l. 4 , n o . 2 ¡ 3 , p p . 9 7 ¡ 2 6 3 , 2 0 0 8 . [1 1 ] I. Cs is z ¶a r a n d J. K Äo r n e r , Information theory: coding theorems for discrete memoryless systems, A c a d e m ic P r e s s , N e w Y o r k, 1 9 8 1 . [1 2 ] C. E . S h a n n o n , \ A Ma t h e m a t ic a l t h e o r y o f c o m m u n ic a t io n " , B e ll S ys t e m Te c h n ic a l Jo u r n a l , vo l. 2 7 , p p . 3 7 9 ¡ 4 2 3 , 6 2 3 ¡ 6 5 6 , Ju ly, Oc t o b e r , 1 9 4 8 [1 3 ] P . F. B r o wn , V . J. D e lla P ie t r a , P . V . d e S o u z a , J. C. L a i, R . L . Me r c e r , \ Cla s s -b a s e d n -g r a m m o d e ls o f n a t u r a l la n g u a g e " , Computational L inguistics, vo l. 1 8 ( 4 ) , p p . 4 6 7 ¡ 4 7 9 , 1 9 9 2 . [1 4 ] L . D . B a ke r a n d A . K . Mc Ca llu m , \ D is t r ib u t io n a l c lu s t e r in g o f wo r d s fo r t e xt c la s s ī c a - t io n " , P roceedings of the 21st annual international ACM SIGIR conference on R esearch and development in information retrieval , p p . 9 6 ¡1 0 3 , 1 9 9 8 . [1 5 ] J. L . E lm a n , \ Fin d in g s t r u c t u r e in t im e " , Cognitive Science, vo l. 1 4 , 1 7 9 ¡2 1 1 , 1 9 9 0 . ´³½Ù³ÏÇ í³ñϳÍÝ»ñÇ ëïáõ·Ù³Ý ë˳ÉÝ»ñÇ Ñ³í³Ý³Ï³ÝáõÃÛáõÝÝ»ñÇ óáõóÇãÝ»ñÇ Éáõë³µ³ÝáõÙÁ ûñÇݳÏÝ»ñáí Ü.¶ñÇ·áñÛ³Ý ²Ù÷á÷áõÙ àõëáõÙݳëÇñí»É ¿ µ³½Ù³ÏÇ í³ñϳÍÝ»ñÇ ëïáõ·Ù³Ý ËݹÇñÁ »ñÏáõ Ù³ñÏáíÛ³Ý ³ÕµÛáõñÝ»ñÇó µ³Õϳó³Í ѳÕáñ¹³ÏóáõÃÛ³Ý Ñ³Ù³Ï³ñ·Ç ¹»åùáõÙ ¨ Ýßí»É »Ý áñáß ÏÇñ³éáõÃÛáõÝÝ»ñ: سëݳÏÇ ûñÇݳÏÇ ¹»åùáõ٠ϳï³ñí»É »Ý Ãí³ÛÇÝ Ñ³ßí³ñÏÝ»ñ ¨ Ý»ñϳ۳óí»É Ñáõë³ÉÇáõÃÛ³Ý Ù³ïñÇóÇ ï³ññ»ñÇ ·ñ³ýÇÏ³Ï³Ý å³ïÏ»ñÝ»ñ: