Rerank-by-Example: Efficient Browsing of Web Search Results
- Cite this paper as:
- Yamamoto T., Nakamura S., Tanaka K. (2007) Rerank-by-Example: Efficient Browsing of Web Search Results. In: Wagner R., Revell N., Pernul G. (eds) Database and Expert Systems Applications. DEXA 2007. Lecture Notes in Computer Science, vol 4653. Springer, Berlin, Heidelberg
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.
Keywordsedit-and-propagate tag-cloud reranking user-interface
Unable to display preview. Download preview PDF.