Eliminate redundancy in parallel search: A multi-agent coordination approach
文献类型:期刊论文
作者 | Luo, Jiewen; Shi, Zhongzhi |
刊名 | PRICAI 2006: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS
![]() |
出版日期 | 2006 |
卷号 | 4099页码:91-100 |
ISSN号 | 0302-9743 |
英文摘要 | Web spider is a widely used approach to obtain information for search engines. As the size of the Web grows, it becomes a natural choice to parallelize the spider's crawling process. However, parallel execution often causes redundant web pages to occupy vast storing space. How to solve this problem becomes a significant issue for the design of next generation web spiders. In this paper, we employ the method from multi-agent coordination to design a parallel spider model and implement it on the multi-agent platform MACE. Through the control of central facilitator agent, spiders can coordinate each other to avoid redundant pages in the web page search process. Experiment results demonstrate that it is very effective to improve the collection efficiency and can eliminate redundant pages with a tiny efficiency cost. |
WOS研究方向 | Computer Science |
语种 | 英语 |
WOS记录号 | WOS:000240091500012 |
出版者 | SPRINGER-VERLAG BERLIN |
源URL | [http://119.78.100.204/handle/2XEOYT63/10339] ![]() |
专题 | 中国科学院计算技术研究所期刊论文_英文 |
通讯作者 | Luo, Jiewen |
作者单位 | 1.Chinese Acad Sci, Inst Comp Technol, Beijing 100080, Peoples R China 2.Grad Univ, Chinese Acad Sci, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Luo, Jiewen,Shi, Zhongzhi. Eliminate redundancy in parallel search: A multi-agent coordination approach[J]. PRICAI 2006: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS,2006,4099:91-100. |
APA | Luo, Jiewen,&Shi, Zhongzhi.(2006).Eliminate redundancy in parallel search: A multi-agent coordination approach.PRICAI 2006: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS,4099,91-100. |
MLA | Luo, Jiewen,et al."Eliminate redundancy in parallel search: A multi-agent coordination approach".PRICAI 2006: TRENDS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS 4099(2006):91-100. |
入库方式: OAI收割
来源:计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。