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. Paper presented at the 25th European Conference on Information Retrieval Research (ECIR 2003), 14-04-2003 - 16-04-2003, Pisa, Italy.

PDF - Accepted Version
Download (338kB) | Preview


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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: The final publication is available at Springer via
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Z Bibliography. Library Science. Information Resources > Z665 Library Science. Information Science
Divisions: School of Informatics > Centre for Human Computer Interaction Design
Related URLs:

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics