ACM Home Page
Please provide us with feedback. Feedback
A semisupervised learning method to merge search engine results
Full text PdfPdf (464 KB)
Source ACM Transactions on Information Systems (TOIS) archive
Volume 21 ,  Issue 4  (October 2003) table of contents
Pages: 457 - 491  
Year of Publication: 2003
ISSN:1046-8188
Authors
Luo Si  Carnegie Mellon University, Pittsburgh, PA
Jamie Callan  Carnegie Mellon University, Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 100,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/944012.944017
What is a DOI?

ABSTRACT

The proliferation of searchable text databases on local area networks and the Internet causes the problem of finding information that may be distributed among many disjoint text databases (distributed information retrieval). How to merge the results returned by selected databases is an important subproblem of the distributed information retrieval task. Previous research assumed that either resource providers cooperate to provide normalizing statistics or search clients download all retrieved documents and compute normalized scores without cooperation from resource providers.This article presents a semisupervised learning solution to the result merging problem. The key contribution is the observation that information used to create resource descriptions for resource selection can also be used to create a centralized sample database to guide the normalization of document scores returned by different databases. At retrieval time, the query is sent to the selected databases, which return database-specific document scores, and to a centralized sample database, which returns database-independent document scores. Documents that have both a database-specific score and a database-independent score serve as training data for learning to normalize the scores of other documents. An extensive set of experiments demonstrates that this method is more effective than the well-known CORI result-merging algorithm under a variety of conditions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Buckley, C., Singhal, A., Mitra, M., and Salton, G. 1995. New retrieval approaches using SMART. In Proceedings of 1995 Text REtrieval Conference (TREC-3), special publication. National Institute of Standards and Technology.
 
3
Callan, J. 2000. Distributed information retrieval. In Advances in Information Retrieval, W. B. Croft, Ed. Kluwer Academic Publishers, pp. 127--150.
4
 
5
6
7
 
8
Craswell, N., Hawking, D., and Thistlewaite, P. 1999. Merging results from isolated search engines. In Proceedings of the 10th Australasian Database Conference. pp. 189--200.
9
10
11
12
13
14
 
15
Ipeirotis, P. and Gravano, L. 2002. Distributed search over the Hidden-Web: Hierarchical database sampling and selection. In Proceedings of the 28th International Conference on Very Large Databases (VLDB).
 
16
Kirsch, S. T. 2003. Document retrieval over networks wherein ranking and relevance scores are computed at the client for multiple database documents. U.S. Patent 5,659,732.
17
 
18
19
 
20
Lemur Toolkit. 2003. http://www.cs.cmu.edu/∼lemur.
21
 
22
Ogilvie, P. and Callan, J. 2001. Experiments using the Lemur toolkit. In Proceedings of 2001 Text REtrieval Conference (TREC 2001), special publication. National Institute of Standards and Technology, Washington, DC.
23
24
 
25
26
27
28
29
30
31
32

CITED BY  10
 
 
 


Peer to Peer - Readers of this Article have also read: