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 [OCRerr]13 Case 1[OCRerr] - The Modi[OCRerr]ied T'wo-Level Search Scheme with 3 Categories Based on the Clustering of 200 Random Queries with the ?11li 35 Queries Used as a Test Collection of Queries. n c K(c,n) ThMcn) P(c,n) R(c,n) 3 .20 35 5.51 .h9 .h3 6 .20 7.61 .60 .50 9 .20 29 13.59 .6h .55 12 * 20 28 21.lh .71 .66 .30 33 9.21'. .67 ho 6 .30 23 16.30 .81 .57 9 .30 12 19. [OCRerr] .80 .78 12 9 30.22 .85 .71 ih 5.57 .79 .50 6 ho 7 17.h3 .95 .71 9 ho 1 9.00 .67 .75 12 ho 1 15.00 .83 .75 3 .50 3 h.oo .78 1.CO 6 .50 1 8.oo 1.00 1.00 0 .50 0 0 0 0 12 .50 0 0 0 0 3 .60 1 h.oo .67 2.00 6 .60 0 0 0 0 9 .60 0 0 0 0 12 .60 0 0 0 0 TOTALS 230 = 12.hh p = .68 T R = .55 T