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 Case 11 - The Modified Two-Level Search Scheme with 10 Categories Based on the Clustering of 200 Random [OCRerr]ueries with the Last 10 [OCRerr]ueries Used as a Test Collection of [OCRerr]eries. e n c K(c,n) M(c,n) P(c,n) R(c,n) 3 .20 10 3.50 .57 6 .20 10 7.70 9 .20 10 12.20 12 .20 10 23.90 .77 .92 3 .30 10 10.30 .73 6 .30 8 15.63 .81 9 .30 3 33.67 .89 .67 12 .30 2 33.00 .92 1.00 3 5 9.20 .87 6 2 17.00 .92 0 9 0 0 0 C 12 0 0 0 0 3 .50 1 .67 0 6 .50 0 C 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 p = .70 TOTAI[OCRerr] 71 = 13.39 T RT = .52