ISR11 A Modified Two-Level Search Algorithm Using Request Clustering chapter V. R. Lesser Harvard University Gerard Salton Use, reproduction, or publication, in whole or in part, is permitted for any purpose of the United States Government. VII-22 MOQified [OCRerr]7o-Leve1 Search Scheme Clustering of 200 Random Queries as Test Collection [OCRerr][OCRerr]th 8 cate&ories Based on [OCRerr]4th First 25 Queries Used of Queries. n C K(c,n) M(c,n) P(c,n) R(c,n) C(c,n) 3 .20 25 6.2[OCRerr] .53 .38 1.24 6 .20 23 7.26 .64 .50 1.13 .20 19 11.53 .68 .56 1.42 `p,. .20 18 15.56 .72 .62 1.78 3 .30 23 6.22 .68 .35 1.22 6 .30 15 11.93 .82 .60 1.40 0 .30 9 15.67 .80 .71 1.78 10. .30 7 25.71 .85 .63 2.57 J 10 11.10 .80 .60 1.60 6 5 13.20 .97 .80 1.60 9 1 9.00 .67 .75 1.00 12 1 15.00 .83 .75 1.00 3 .50 2 4.oo .83 1.50 1.00 6 .50 1 8.oo 1.00 1.00 1.00 9 .50 0 0 0 0 0 12 .50 0 0 0 0 0 3 .60 1 4.00 .67 2.00 1.00 6 .60 0 a 0 0 0 9 .60 0 0 0 0 0 12 .60 0 0 0 0 0 ToTAr[OCRerr] 160 = 10.54 = .70 RT = .55 CT = 1.43 Sample Output From Evaluation Program Figure 3