基于Agent动态协作的信息检索

Kai Gao, Yongcheng Wang, Zhiqi Wang
{"title":"基于Agent动态协作的信息检索","authors":"Kai Gao, Yongcheng Wang, Zhiqi Wang","doi":"10.1109/IAT.2004.1342972","DOIUrl":null,"url":null,"abstract":"We propose a dynamic cooperation model for different agents' message exchanging. Besides, we propose a new algorithm, which makes it easy to transform a traditional Boolean logical query statement into a matrix. This method allows a document might be retrieved in a clear Boolean view even it matches the query partially. On the base of them, we implement an agent-based selective information retrieval. Parallel crawlers make the prototype scalability and network-load reduction. The focused crawler makes it easy to find as many relevant pages and as few irrelevant pages as possible. Through experiments, we show the results.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Agent dynamic cooperation based information retrieval\",\"authors\":\"Kai Gao, Yongcheng Wang, Zhiqi Wang\",\"doi\":\"10.1109/IAT.2004.1342972\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a dynamic cooperation model for different agents' message exchanging. Besides, we propose a new algorithm, which makes it easy to transform a traditional Boolean logical query statement into a matrix. This method allows a document might be retrieved in a clear Boolean view even it matches the query partially. On the base of them, we implement an agent-based selective information retrieval. Parallel crawlers make the prototype scalability and network-load reduction. The focused crawler makes it easy to find as many relevant pages and as few irrelevant pages as possible. Through experiments, we show the results.\",\"PeriodicalId\":281008,\"journal\":{\"name\":\"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAT.2004.1342972\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAT.2004.1342972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种不同智能体信息交换的动态合作模型。此外,我们还提出了一种新的算法,使传统的布尔逻辑查询语句可以很容易地转化为矩阵。该方法允许在一个清晰的布尔视图中检索文档,即使它部分匹配查询。在此基础上,实现了基于agent的选择性信息检索。并行爬虫使原型具有可伸缩性并降低了网络负载。集中的爬虫可以很容易地找到尽可能多的相关页面和尽可能少的不相关页面。通过实验,给出了实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Agent dynamic cooperation based information retrieval
We propose a dynamic cooperation model for different agents' message exchanging. Besides, we propose a new algorithm, which makes it easy to transform a traditional Boolean logical query statement into a matrix. This method allows a document might be retrieved in a clear Boolean view even it matches the query partially. On the base of them, we implement an agent-based selective information retrieval. Parallel crawlers make the prototype scalability and network-load reduction. The focused crawler makes it easy to find as many relevant pages and as few irrelevant pages as possible. Through experiments, we show the results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信