Scatter/Gather: a cluster-based approach to browsing large document collections
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
CWS: a comparative web search system
Proceedings of the 15th international conference on World Wide Web
Finding pertinent page-pairs from web search results
ICADL'05 Proceedings of the 8th international conference on Asian Digital Libraries: implementing strategies and sharing experiences
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
A query-free retrieving method based on content elements' order for multimedia news archives
ICADL'07 Proceedings of the 10th international conference on Asian digital libraries: looking back 10 years and forging new frontiers
WeBrowSearch: toward web browser with autonomous search
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
| Hi-index | 0.00 |
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.