Real-time Web Search Framework for Performing Efficient Retrieval of Data

IF 0.3 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
F. Al-akashi, D. Inkpen
{"title":"Real-time Web Search Framework for Performing Efficient Retrieval of Data","authors":"F. Al-akashi, D. Inkpen","doi":"10.31341/jios.45.1.13","DOIUrl":null,"url":null,"abstract":"With the rapidly growing amount of information on the internet, real-time system is one of the key strategies to cope with the information overload and to help users in finding highly relevant information. Real-time events and domain-specific information are important knowledge base references on the Web that frequently accessed by millions of users. Real-time system is a vital to product and a technique must resolve the context of challenges to be more reliable, e.g. short data life-cycles, heterogeneous user interests, strict time constraints, and context-dependent article relevance. Since real-time data have only a short time to live, real-time models have to be continuously adapted, ensuring that real-time data are always up-to-date. The focal point of this manuscript is for designing a real-time web search approach that aggregates several web search algorithms at query time to tune search results for relevancy. We learn a context-aware delegation algorithm that allows choosing the best real-time algorithms for each query request. The evaluation showed that the proposed approach outperforms the traditional models, in which it allows us to adapt the specific properties of the considered real-time resources. In the experiments, we found that it is highly relevant for most recently searched queries, consistent in its performance, and resilient to the drawbacks faced by other algorithms","PeriodicalId":43428,"journal":{"name":"Journal of Information and Organizational Sciences","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2021-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information and Organizational Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31341/jios.45.1.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

Abstract

With the rapidly growing amount of information on the internet, real-time system is one of the key strategies to cope with the information overload and to help users in finding highly relevant information. Real-time events and domain-specific information are important knowledge base references on the Web that frequently accessed by millions of users. Real-time system is a vital to product and a technique must resolve the context of challenges to be more reliable, e.g. short data life-cycles, heterogeneous user interests, strict time constraints, and context-dependent article relevance. Since real-time data have only a short time to live, real-time models have to be continuously adapted, ensuring that real-time data are always up-to-date. The focal point of this manuscript is for designing a real-time web search approach that aggregates several web search algorithms at query time to tune search results for relevancy. We learn a context-aware delegation algorithm that allows choosing the best real-time algorithms for each query request. The evaluation showed that the proposed approach outperforms the traditional models, in which it allows us to adapt the specific properties of the considered real-time resources. In the experiments, we found that it is highly relevant for most recently searched queries, consistent in its performance, and resilient to the drawbacks faced by other algorithms
用于执行有效数据检索的实时Web搜索框架
随着互联网信息量的迅速增长,实时系统是应对信息过载、帮助用户查找高度相关信息的关键策略之一。实时事件和特定于领域的信息是数百万用户经常访问的Web上重要的知识库引用。实时系统对产品来说是至关重要的,一种技术必须解决上下文的挑战才能更加可靠,例如短的数据生命周期、异构的用户兴趣、严格的时间限制和上下文相关的文章相关性。由于实时数据的存在时间很短,因此必须不断调整实时模型,以确保实时数据始终是最新的。本文的重点是设计一个实时网络搜索方法,该方法在查询时聚合了几个网络搜索算法,以调整搜索结果的相关性。我们学习了一种上下文感知委派算法,该算法允许为每个查询请求选择最佳的实时算法。评估表明,所提出的方法优于传统模型,在传统模型中,它允许我们适应所考虑的实时资源的特定属性。在实验中,我们发现它与最近搜索的查询高度相关,性能一致,并且能够适应其他算法面临的缺点
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Information and Organizational Sciences
Journal of Information and Organizational Sciences COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
1.10
自引率
0.00%
发文量
14
审稿时长
12 weeks
×
引用
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学术官方微信