首页> 中文期刊> 《计算机技术与发展》 >一种元搜索主题偏好的排序算法

一种元搜索主题偏好的排序算法

         

摘要

元搜索引擎并行地向各个成员搜索引擎发出请求,合并及处理所有成员引擎的返回结果。相对于传统搜索引擎,元搜索引擎具有更好的查全率但在结果相关度排序及查准率方面仍需要改善。就相关度排序及查准率方面的问题元搜索成员引擎对于各个不同主题具有不同的检索质量并就此提出一种基于主题偏好的排序方法。利用Beeferman聚类方法对检索主题划分,通过Borda排序算法对元搜索引擎获得条目进行基于主题的分类排序,以此来提高元搜索查询质量和改善用户体验。%Meta-search engine launches query simultaneously to its member search engines and shows a combined and ranked results list. Compared with the traditional search engine,meta-search engine has a better recall rate. However with the large amount of return items from its member engines,the precision rate and MMR still need to be perfected. Each member engine performs differently in the searching tasks with different topics in view of precision rate and MMR. In this paper,present a topic preference based ranking algorithm. Using Beeferman clustering method divides the search topic,with Borda ranking algorithm classify and rank the entries obtained by meta-search engine based on topic,improving the meta-search query quality and enhancing user experience.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号