Comparing the Performance of Database Selection Algorithms (1999)
Cached
Download Links
- [ftp.cs.virginia.edu]
- [www.cs.cmu.edu]
- [www.cs.virginia.edu]
- [www.cs.virginia.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 89 - 23 self |
BibTeX
@MISC{French99comparingthe,
author = {James C. French and Allison L. Powell and Jamie Callan and Charles L. Viles and Travis Emmit and Kevin J. Prey and Yun Mon},
title = {Comparing the Performance of Database Selection Algorithms},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for database selection techniques. The testbed is a decomposition of the TREC/- TIPSTER data into 236 subcollections. We present results of a recent investigation of the performance of the CORI algorithm and compare the performance with earlier work that examined the performance of gGlOSS. The databases from our testbed were ranked using both the gGlOSS and CORI techniques and compared to the RBR baseline, a baseline derived from TREC relevance judgements. We examined the degree to which CORI and gGlOSS approximate this baseline. Our results confirm our earlier observation that the gGlOSS Ideal(l) ranks do not estimate relevance- This work supported in part by DARPA contract N6600197 -C-8542 and NASA GSRP NGT5-50062. y This work supported in part by NSF, the Library of Congress, and the Department of Commerce under agre...
