City Research Online

Abstract

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:	Conference or Workshop Item (Paper)
Additional Information:	The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-36618-0_40
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Z Bibliography. Library Science. Information Resources > Z665 Library Science. Information Science
Departments:	School of Science & Technology > Computer Science > Human Computer Interaction Design
Related URLs:	Author

Export

Downloads