A Novel Approach to Evaluate the Top K Interesting Ranks from Web Search Engines

Abstract

In recent years, several search engines had been developed to help people find interesting information among the rapidly increasing number of web pages in the Internet. To obtain useful and reasonable searching results, users may submit queries with more than one query terms combined by a Boolean expression, which has been supported by all existing search engines. However, these search engines all put the same emphases on every query term combined by the Boolean expression. In other words, all search engines nowadays do not consider that users may want to put more emphases on one term rather than on the others. In this paper we propose a novel approach, called Extreme Score Analysis method (ESA method), to solve this problem. Our ESA method can efficiently find the top K (K > 0) interesting web pages when the user assigns different weights for query terms.