Conventional Web search engines rank their searched results page by page. That is, conventionally, the information unit for both searching and ranking is a single Web page. There are, however, cases where a set of searched pages shows a better similarity (relevance) to a given (keyword) query than each individually searched page. This is because the information a user wishes to have is sometimes distributed on multiple Web pages. In such cases, the information unit used for ranking should be a set of pages rather than a single page. In this paper, we propose the notion of a "page set ranking", which is to rank each pertinent set of searched Web pages. We describe our new algorithm of the page set ranking to efficiently construct and rank page sets. We present some experimental results and the effectiveness of our approach. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Yumoto, T., & Tanaka, K. (2006). Page sets as web search answers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4312 LNCS, pp. 244–253). Springer Verlag. https://doi.org/10.1007/11931584_27
Mendeley helps you to discover research relevant for your work.