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. Case 1+ - The No[OCRerr]na1 [OCRerr][OCRerr]-Leve1 Search the Clustering of Doc[OCRerr][OCRerr]mients Test Collection of [OCRerr]eries. v'I-33 Scheme with 10 Cate&ories Based on with the First 25 Queries Used as a n C K(c,n) M(c,n) P(c,n) R(c,n) C(c,n) 3 .20 25 7.00 .6L[OCRerr] i.4o 6 .20 23 9.70 .56 .61 i.2[OCRerr]8 9 .20 19 12.89 .62 .52 1.58 12 .20 i8 16.89 .67 .60 2.28 3 .30 23 10.70 .62 .61 1.65 6 .30 15 1[OCRerr].67 .72 .58 1.87 .30 9 19.67 .79 .67 2.56 9 12 .30 7 23.[OCRerr]3 .85 .86 2.71 3 10 7.80 .70 .85 1.30 6 5 13.20 .93 .80 1.80 9 1 10.00 .78 1.00 1.00 12 1 17.00 .83 1.00 2.00 3 .50 2 5.50 .67 1.50 1.00 6 .50 1 8.00 .83 1.33 1.00 9 .50 0 0 0 0 0 12 .50 0 0 0 0 0 3 .60 1 3.00 .33 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 = 12.17 FT = RT = .66 CT = 1.73