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-30 APFE[OCRerr]IX A E[OCRerr][OCRerr]1uation Output Case 1 - The Normal Two-Level Search Scheme [OCRerr]ith 8 Categories Based on the Clustering of Documents [OCRerr]dth the First 25 [OCRerr]ueries used as a Test Collection of Oueries. c K(c,n) M(c,n) P(c,n) [OCRerr]R(c,n) C(c,n) 3 .20 25 5.52 .60 1.16 6 .20 23 io.48 .58 .63 l.[OCRerr]3 9 .20 19 13.37 .63 l.7[OCRerr] 12 .20 18 18.67 .69 .65 2.17 .6l[OCRerr] .59 1[OCRerr]57 30 9.83 23 6 .30 15 13.[OCRerr]7 .76 .55 1.80 9 .30 9 17.67 .81 .67 2.00 12 .30 7 23.[OCRerr]3 .90 .86 2.86 3 .[OCRerr]0 10 7.70 .70 .85 l.[OCRerr]0 6 .[OCRerr]o 5 18.20 .93 .80 2.[OCRerr]0 9 .1+o 1 10.00 .89 1.00 1.00 12 .[OCRerr]0 1 19.00 1.00 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.12 P RT = .67 CT = 1.67 T = .65