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-42 Case 13 - The I[OCRerr]rma1 Two-Level Search Scheme with 8 Categories Based on the Clustering of Documents with the Full 35 [OCRerr]ueries Used as a Test Collection of Queries. n c K(c,n) M(c,n) P(c,n) R(c,n) 3 .20 35 3.83 .47 6 .20 33 7.79 .61 .58 9 .20 29 15.24 .64 .48 12 .20 28 20.50 .73 .63 3 .30 33 8.oo .65 .39 6 .30 23 19.87 .78 .46 9 .30 12 19.92 .82 .64 12 .30 9 21.56 .90 .78 3 .40 15 13.27 .76 .67 6 .4o 7 18.57 .93 .62 9 .4o 1 10.00 .89 1.00 12 .4o 1 13.00 .92 1.00 3 .50 3 3.57 .56 1.00 6 .50 1 6.00 .83 1.33 9 .50 0 0 0 0 12 .50 0 0 0 C 3 .6o 1 3.00 .33 2.00 6 .6o 0 0 0 0 .60 0 0 0 0 12 .60 0 0 0 0 TOTALS 231 = 12.70 = .67 R = .55 T