Lee, J.H.; Kim, M.H.; Lee, Y.J.: Information retrieval based on conceptual distance in is-a hierarchies (1993)
0.01
0.009623346 = product of:
0.038493384 = sum of:
0.038493384 = product of:
0.07698677 = sum of:
0.07698677 = weight(_text_:model in 6729) [ClassicSimilarity], result of:
0.07698677 = score(doc=6729,freq=4.0), product of:
0.1830527 = queryWeight, product of:
3.845226 = idf(docFreq=2569, maxDocs=44218)
0.047605187 = queryNorm
0.4205716 = fieldWeight in 6729, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.845226 = idf(docFreq=2569, maxDocs=44218)
0.0546875 = fieldNorm(doc=6729)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- There have been several document ranking methods to calculate the conceptual distance or closeness between a Boolean query and a document. Though they provide good retrieval effectiveness in many cases, they do not support effective weighting schemes for queries and documents and also have several problems resulting from inappropriate evaluation of Boolean operators. We propose a new method called Knowledge-Based Extended Boolean Model (KB-EBM) in which Salton's extended Boolean model is incorporated. KB-EBM evaluates weighted queries and documents effectively, and avoids the problems of the previous methods. KB-EBM provides high quality document rankings by using term dependence information from is-a hierarchies. The performance experiments show that the proposed method closely simulates human behaviour
