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. v'I-31 Case 2 - The Modi[OCRerr]ied [OCRerr]io-Leve1 Search Scheme with 8 Categories Based on the Clustering o[OCRerr] 200 Random Oueries with the First 25 Queries used as a Test Collection o[OCRerr] Queries. n c K(c,n) M(c,n) R(c,n) C(c,n) 3 .20 25 6.22[OCRerr] .53 .38 1.2[OCRerr] 6 .20 23 7.26 .50 1.13 9 .20 19 11.53 .68 .56 1.[OCRerr]2 12 .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.[OCRerr]0 9 .30 9 15.57 .80 .71 1.78 12 .30 7 25.71 .85 .63 2.57 3 10 11.10 .80 .60 1.60 6 5 13.20 .97 .8o 1.60 9 1 9.00 .67 .75 1.00 12 1 15.00 .83 .75 1.00 3 .50 2 [OCRerr].00 .83 1.50 1.00 6 .50 1 8.00 1.00 1.00 *1.00 9 .50 0 0 0 0 0 12 .50 0 0 0 0 0 3 .60 1 [OCRerr].00 .67 2.00 1.00 6 .60 0 0 0 0 0 9 .60 0 0 0 0 0 12 .60 0 0 0 0 0 TOTALS 160 = l0.5[OCRerr] [OCRerr]T = .70 R = .55 CT 1.[OCRerr]3 T