City Research Online

Parallel Computing for Term Selection in Routing/Filtering

MacFarlane, A., Robertson, S. E. & McCann, J. A. (2003). Parallel Computing for Term Selection in Routing/Filtering. In: Sebastiani, F. (Ed.), Advances in Information Retrieval. Lecture Notes in Computer Science, 2633. (pp. 537-545). Berlin: Springer-Verlag. doi: 10.1007/3-540-36618-0_40


It has been postulated that a method of selecting terms in either routing or filtering using relevance feedback would be to evaluate every possible combination of terms in a training set and determine which combination yields the best retrieval results. Whilst this is not a realistic proposition because of the enormous size of the search space, some heuristics have been developed on the Okapi system to tackle the problem which are computationally intensive. This paper describes parallel computing techniques that have been applied to these heuristics to reduce the time it takes to select to select terms.

Publication Type: Book Section
Additional Information: The final publication is available at Springer via
Subjects: Z Bibliography. Library Science. Information Resources > Z665 Library Science. Information Science
Departments: School of Science & Technology > Computer Science > Human Computer Interaction Design
PDF - Accepted Version
Download (338kB) | Preview



Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login