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-38 Case 9 - The Modified [OCRerr][OCRerr]-Leve1 Search Scheme with 8 Cate[OCRerr]ories Based on the Clustering of the First 25 Queries with the Last 10 Queries Used as a Test Collection of Queries. n C K(c,n) M(c,n) P(c,n) R(c,n) .20 10 3.80 .37 .55 6 .20 10 8.ho .50 .50 q .20 10 17.50 .58 .52 .1[OCRerr]2 .20 10 31.20 .69 .73 .30 10 16.20 .63 .53 6 .30 8 21+.50 .79 .51 9 .30 3 30.33 .78 1.00 12 .30 2 h6.5o .87 1.00 5 8.00 .8o ho 6 .1+0 2 28.00 .92 .50 Q 0 0 0 0 ho 0 0 0 0 3 .50 1 h.oo .67 0 6 .50 0 0 0 0 9 .50 0 0 0 0 12 .50 0 0 0 0 3 .60 0 0 0 0 6 .60 0 0 0 0 9 .60 0 0 0 0 12 .60 0 0 0 0 TOTALS 71 = 17.52 = .63 T .57