ISR11
Scientific Report No. ISR-11 Information Storage and Retrieval
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-32
Case 3 - The `Aoiified Two-Level Search Scheme with 8
the Clustering of the First 25 [OCRerr]ueries with
Used as a Test Collection of [OCRerr]ueries.
Categories Based on
the First 25 Queries
n c M(c,n) P(c,n) ?(c,n)
3 .20 25 [OCRerr].i6 .52
6 .20 23 8.00 .61[OCRerr] .60
9 .20 19 13.95 .66 .52
12 .20 18 16.83 .70 .59
3 .30 23 6.78 .61[OCRerr]
6 .30 15 16.67 .78
9 .30 9 17.78 .83 .63
12 .30 7 i8.i[OCRerr] .89 .71
3 10 l[OCRerr].10 .73 .80
6 5 1[OCRerr].00 .97 .87
9 1 10.00 .89 1.00
12 1 13.00 .92 1.00
3 .50 2 [OCRerr].00 .67 1.50
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 .33 2.00
6 .60 0 0 0 0
9 .60 0 0 0 0
12 .60 0 0 0 0
TOTALS 160 = 11.25 P .67
T RT = .60
C(c,n)
i.o4
1.89
1.[OCRerr]2
i.[OCRerr]4
1.13
1.73
2.00
1.86
1.80
1.60
1.00
1.00
1.00
1.00
0
0
1.00
0
0
0
1.37
C=
T