ACM Home Page
Please provide us with feedback. Feedback
Expert agreement and content based reranking in a meta search environment using Mearf
Full text PdfPdf (510 KB)
Source International World Wide Web Conference archive
Proceedings of the 11th international conference on World Wide Web table of contents
Honolulu, Hawaii, USA
SESSION: Search 1 table of contents
Pages: 333 - 344  
Year of Publication: 2002
ISBN:1-58113-449-5
Authors
B. Uygar Oztekin  University of Minnesota
George Karypis  University of Minnesota
Vipin Kumar  University of Minnesota
Sponsors
ACM: Association for Computing Machinery
: WWW'02
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 54,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/511446.511490
What is a DOI?

ABSTRACT

Recent increase in the number of search engines on the Web and the availability of meta search engines that can query multiple search engines makes it important to find effective methods for combining results coming from different sources. In this paper we introduce novel methods for reranking in a meta search environment based on expert agreement and contents of the snippets. We also introduce an objective way of evaluating different methods for ranking search results that is based upon implicit user judgements. We incorporated our methods and two variations of commonly used merging methods in our meta search engine, Mearf, and carried out an experimental study using logs accumulated over a period of twelve months. Our experiments show that the choice of the method used for merging the output produced by different search engines plays a significant role in the overall quality of the search results. In almost all cases examined, results produced by some of the new methods introduced were consistently better than the ones produced by traditional methods commonly used in various meta search engines. These observations suggest that the proposed methods can offer a relatively inexpensive way of improving the meta search experience over existing methods.


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
C4.com. http://www.c4.com/.
3
4
 
5
6
 
7
8
 
9
Adele E. Howe and Daniel Dreilinger. SAVVYSEARCH: A metasearch engine that learns which search engines to query. AI Magazine, 18(2):19--25, 1997.
 
10
Inquirus. http://www.inquirus.com/.
 
11
Panagiotis Ipeirotis, Luis Gravano, and Mehran Sahami. Automatic classification of text databases through query probing. Technical Report CUCS-004-00, Computer Science Department, Columbia University, March 2000.
 
12
Ixquick. http://www.ixquick.com/.
13
 
14
Longzhuang Li and Li Shang. Statistical performance evaluation of search engines. In WWW10 conference posters, May 2--5, 2001, Hong Kong.
 
15
Mamma. http://www.mamma.com/.
16
 
17
Metacrawler. http://www.metacrawler.com/.
 
18
Profusion. http://www.profusion.com/.
 
19
 
20
E. Selberg and O. Etzioni. Multi-service search and comparison using the MetaCrawler. In Proceedings of the 4th International World-Wide Web Conference, Darmstadt, Germany, December 1995.
 
21
E. Selberg and O. Etzioni. The MetaCrawler architecture for resource aggregation on the Web. IEEE Expert, (January--February):11--14, 1997.
 
22
Joseph A. Shaw and Edward A. Fox. Combination of multiple searches. In Third Text REtrieval Conference, 1994.
 
23
Mario Gomez Susan Gauch, Guijun Wang. Profusion: Intelligent fusion from multiple, distributed search engines. Journal of Universal Computer Science, 2(9):637--649, 1996.
 
24
25
26

CITED BY  11

Collaborative Colleagues:
B. Uygar Oztekin: colleagues
George Karypis: colleagues
Vipin Kumar: colleagues