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]5 Case 16 - The [OCRerr]ormal [OCRerr]7o-Leve1 Search Scheme with 10 Categories Based on the Clustering of Documents with the Full 35 Queries Used as a Test Collection of Queries. n c K(c,n) M(c,n) P(c,n) R(c, n) .20 35 3.54 .60 6 .20 33 7.85 .60 .52 9 .20 29 12.62 .67 .51 12 .20 28 18.71 .71[OCRerr] .73 3 .30 33 7.06 .73 .51 6 .30 23 l[OCRerr].57 .79 .55 9 30 12 21.75 .86 .75 12 .30 9 22.11 .90 .78 3 15 10.87 .78 .63 6 .4Q 7 19.29 .95 .62 9 1 9.00 1.00 1.00 12 1 13.00 .92 1.00 3 .50 3 3.33 .78 .67 6 .50 1 6.00 .83 1.33 9 .50 0 0 0 0 12 .50 0 0 0 0 3 .60 1 3.00 .67 1.00 6 .60 0 0 0 0 9 .60 0 0 0 0 12 .60 0 0 0 0 TOTALS 231 = ll.[OCRerr]3 P = .72 T PT = .57