Dynamic selection method of the best search engine for a user's query

Kodai Mizuno, K. Kawagoe
{"title":"Dynamic selection method of the best search engine for a user's query","authors":"Kodai Mizuno, K. Kawagoe","doi":"10.1145/1667780.1667859","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new dynamic selection method of the best search engine for a user's query. When users retrieve on the Internet, the expert users manually select the best search engine for their queries. However, the most important problem is that the novice users cannot understand features of all search engines. Consequently, because such users cannot select the best search engine, the users cannot obtain the best retrieval results. In this paper, we focus the number of retrieval results, and we calculate search engines' matching scores suitable for the user's query by using this focus point. As a result, novice users can select the best search engine using the scores calculated by our system.","PeriodicalId":103128,"journal":{"name":"Proceedings of the 3rd International Universal Communication Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Universal Communication Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1667780.1667859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a new dynamic selection method of the best search engine for a user's query. When users retrieve on the Internet, the expert users manually select the best search engine for their queries. However, the most important problem is that the novice users cannot understand features of all search engines. Consequently, because such users cannot select the best search engine, the users cannot obtain the best retrieval results. In this paper, we focus the number of retrieval results, and we calculate search engines' matching scores suitable for the user's query by using this focus point. As a result, novice users can select the best search engine using the scores calculated by our system.
动态选择最适合用户查询的搜索引擎的方法
本文提出了一种针对用户查询的最佳搜索引擎动态选择方法。当用户在互联网上检索时,专家用户手动为他们的查询选择最佳搜索引擎。然而,最重要的问题是新手用户不能理解所有搜索引擎的功能。因此,由于这些用户无法选择最佳的搜索引擎,用户无法获得最佳的检索结果。在本文中,我们对检索结果的数量进行聚焦,并利用这个焦点计算出适合用户查询的搜索引擎匹配分数。因此,新手用户可以使用我们的系统计算的分数来选择最好的搜索引擎。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信