Aggregation of web search engines based on users’ preferences in WebFusion

作者:

Highlights:

摘要

The required information of users is distributed in the databases of various search engines. It is inconvenient and inefficient for an ordinary user to invoke multiple search engines and identify useful documents from the returned results. Meta-search engines could provide a unified access for their users. In this paper, a novel meta-search engine, named as WebFusion, is introduced. WebFusion learns the expertness of the underlying search engines in a certain category based on the users’ preferences. It also uses the “click-through data concept” to give a content-oriented ranking score to each result page. Click-through data concept is the implicit feedback of the users’ preferences, which is also used as a reinforcement signal in the learning process, to predict the users’ preferences and reduces the seeking time in the returned results list. The decision lists of underling search engines have been fused using ordered weighted averaging (OWA) approach and the application of optimistic operator as weightening function has been investigated. Moreover, the results of this approach have been compared with those achieve by some popular meta-search engines such as ProFusion and MetaCrawler. Experimental results demonstrate a significant improvement on average click rate, and the variance of clicks as well as average relevancy criterion.

论文关键词:Meta-search engine,User preferences modeling,Click-through data,Reinforcement learning,Optimistic OWA,Decision fusion

论文评审过程:Received 1 March 2006, Revised 26 July 2006, Accepted 8 August 2006, Available online 7 September 2006.

论文官网地址:https://doi.org/10.1016/j.knosys.2006.08.001