基于元启发式搜索和查询扩展的分布式信息检索

A. A. Abdul Hassan, M. J. Hadi
{"title":"基于元启发式搜索和查询扩展的分布式信息检索","authors":"A. A. Abdul Hassan, M. J. Hadi","doi":"10.31642/jokmc/2018/040302","DOIUrl":null,"url":null,"abstract":"Distributed information retrieval DIR is a model enables a user to access many searchable databases reside in different locations. DIR is more complex than the centralized information retrieval IR . It requires addressing two significant additional problems that are the resource selection and the results merging. Many techniques for addressing the two problems have been published in the literature. However they still have a negative impact on retrieving quality and response time. This paper aims to improve the DIR efficiency through using a meta heuristic algorithm and improving the result quality through a query expansion. The algorithm has been strengthened using the nearest neighbor graph in order to improve the search performance.","PeriodicalId":115908,"journal":{"name":"Journal of Kufa for Mathematics and Computer","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Distributed Information Retrieval Based On Metaheuristic Search and Query Expansion\",\"authors\":\"A. A. Abdul Hassan, M. J. Hadi\",\"doi\":\"10.31642/jokmc/2018/040302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed information retrieval DIR is a model enables a user to access many searchable databases reside in different locations. DIR is more complex than the centralized information retrieval IR . It requires addressing two significant additional problems that are the resource selection and the results merging. Many techniques for addressing the two problems have been published in the literature. However they still have a negative impact on retrieving quality and response time. This paper aims to improve the DIR efficiency through using a meta heuristic algorithm and improving the result quality through a query expansion. The algorithm has been strengthened using the nearest neighbor graph in order to improve the search performance.\",\"PeriodicalId\":115908,\"journal\":{\"name\":\"Journal of Kufa for Mathematics and Computer\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Kufa for Mathematics and Computer\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31642/jokmc/2018/040302\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Kufa for Mathematics and Computer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31642/jokmc/2018/040302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

分布式信息检索DIR是一种使用户能够访问驻留在不同位置的许多可搜索数据库的模型。DIR比集中式信息检索IR更为复杂。它需要解决两个重要的附加问题,即资源选择和结果合并。许多解决这两个问题的技术已经在文献中发表。然而,它们仍然对检索质量和响应时间产生负面影响。本文旨在通过使用元启发式算法来提高DIR效率,并通过查询扩展来提高结果质量。为了提高算法的搜索性能,本文还使用了最近邻图对算法进行了增强。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed Information Retrieval Based On Metaheuristic Search and Query Expansion
Distributed information retrieval DIR is a model enables a user to access many searchable databases reside in different locations. DIR is more complex than the centralized information retrieval IR . It requires addressing two significant additional problems that are the resource selection and the results merging. Many techniques for addressing the two problems have been published in the literature. However they still have a negative impact on retrieving quality and response time. This paper aims to improve the DIR efficiency through using a meta heuristic algorithm and improving the result quality through a query expansion. The algorithm has been strengthened using the nearest neighbor graph in order to improve the search performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信