Lee HC "Metasearch via the co-citation graph " IC' 03 ; Procceding of the International Conference on Internet Computing, Vols 1 and 2, 2003. p.24-30 CSRE A Press, Athens

[Eugene Garfield]

Lee Hyun Chul    :   leehyun at cs.toronto.edu

TITLE      :    Metasearch via the co-citation graph  -
                   Full text available at: http://www.cs.toronto.edu/~leehyun/

AUTHOR:     Lee, HC
SOURCE:    IC' 03 ; Procceding of the International Conference on Internet Computing,
                   Vols 1 and 2, 2003. p.24-30 CSRE A Press, Athens

ADDRESS: Dept of Computer Science, University of Toronto, Torontom Ontario M5S3G4

Abstract :  Abstract—In spite of numerous search engines available on the
web, no single engine is capable of performing “better” under
all circumstances. This being the case, metasearch engines have
appeared. One major issue in metasearch engine design is the
merging problem: given the ranked lists of pages returned by
multiple search engines in response to a given query, what is the
best way to combine these lists into a single list? In this paper, we
present an algorithm based on the co-citation graph constructed
from search engines and returned lists of pages to handle this
issue. Our algorithm can be implemented in a simple and naive
manner while based on a rigorous and intuitive treatment of the
problem. Unlike those techniques that rely on the relevant scores
of pages, our algorithm can be implemented using only the rank
information.