作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (15): 220-222. doi: 10.3969/j.issn.1000-3428.2008.15.079

• 人工智能及识别技术 • 上一篇    下一篇

基于关键词相关度的Deep Web爬虫爬行策略

田 野,丁岳伟   

  1. (上海理工大学计算机工程学院,上海 200093)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-08-05 发布日期:2008-08-05

Crawlers Crawling Strategy of Deep Web Based on Keywords Relevant Weight

TIAN Ye, DING Yue-wei   

  1. (Institute of Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-08-05 Published:2008-08-05

摘要: Deep Web蕴藏丰富的、高质量的信息资源,为了获取某Deep Web站点的页面,用户不得不键入一系列的关键词集。由于没有直接指向Deep Web页面的静态链接,目前大多数搜索引擎不能发现这些页面。该文提出的Deep Web爬虫爬行策略,可以有效地下载Deep Web页面。由于该页面只提供一个查询接口,因此Deep Web爬虫设计面对的主要挑战是怎样选择最佳的查询关键词产生有意义的查询。实验证明文中提出的一种基于不同关键词相关度权重的选择方法是有效的。

关键词: Deep Web页面, 爬行策略, 关键词选择, 相关度权重, 覆盖率

Abstract: There is plenty high-quality information in Deep Web, but user has to input several keywords to search and reach the pages of Deep Web. Traditional crawlers cannot get to the Hidden Web pages because there are no direct links to pages of Deep Web. This paper presents a crawling strategy that can download the pages of Deep Web effectively. As the result of the only interface that Deep Web provides, the biggest challenge for Deep Web crawler is how to choose the best keywords to query effectively. This paper brings forward a new selecting method that based on the relevant weight of different keywords. The experiment shows that this method is efficient.

Key words: Deep Web, crawling strategy, keywords selection, relevant weight, covering rate

中图分类号: