Reranking and Classifying Search Results Exhaustively Based on Edit-and-Propagate Operations

  • Takehiro Yamamoto
  • Satoshi Nakamura
  • Katsumi Tanaka
Conference paper

DOI: 10.1007/978-3-642-03573-9_73

Volume 5690 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Yamamoto T., Nakamura S., Tanaka K. (2009) Reranking and Classifying Search Results Exhaustively Based on Edit-and-Propagate Operations. In: Bhowmick S.S., Küng J., Wagner R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg

Abstract

Search engines return a huge number of Web search results, and the user usually checks merely the top 5 or 10 results. However, the user sometimes must collect information exhaustively such as collecting all the publications which a certain person had written, or gathering a lot of useful information which assists the user to buy. In this case, the user must repeatedly check search results that are clearly irrelevant. We believe that people would use a search system which provides the reranking or classifying functions by the user’s interaction. We have already proposed a reranking system based on the user’s edit-and-propagate operations. In this paper, we introduce the drag-and-drop operation into our system to support the user’s exhaustive search.

Keywords

Reranking term-based-feedback exhaustive search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Takehiro Yamamoto
    • 1
  • Satoshi Nakamura
    • 1
  • Katsumi Tanaka
    • 1
  1. 1.Department of Social Informatics, Graduate School of InformaticsKyoto UniversityKyotoJapan