Rerank-by-Example: Efficient Browsing of Web Search Results

  • Takehiro Yamamoto
  • Satoshi Nakamura
  • Katsumi Tanaka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4653)

Abstract

The conventional Web search has two problems. The first is that users’ search intentions are diverse. The second is that search engines return a huge number of search results which are not ordered correctly. These problems decrease the accuracy of Web searches. To solve these problems, in our past work, we proposed a reranking system based on the user’s search intentions whereby the user edits a part of the search results and the editing operations are propagated to all of the results to rerank them. In this paper, we propose methods of reranking Web search results that depend on the user’s delete and emphasis operations. Then, we describe their evaluation. In addition, we propose a method to support deletion and emphasis by using Tag-Clouds.

Keywords

edit-and-propagate tag-cloud reranking user-interface 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Takehiro Yamamoto
    • 1
  • Satoshi Nakamura
    • 1
  • Katsumi Tanaka
    • 1
  1. 1.Department of Social Informatics, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo, Kyoto 606-8501Japan

Personalised recommendations