Weighted Information Retrieval Algorithms for Onsite Object Service

Ping Cai, Liang He
{"title":"Weighted Information Retrieval Algorithms for Onsite Object Service","authors":"Ping Cai, Liang He","doi":"10.1109/ICCGI.2007.64","DOIUrl":null,"url":null,"abstract":"Designing proper algorithm is necessary for applications that query and analyze mass-information for high efficiency in various information services. In this paper, we discuss weighted information retrieval algorithms for an newly service, onsite object service. Four retrieval algorithms with one-dimension weight and one retrieval algorithm with multi-dimension weight are proposed to address the requirements of OOS. Detailed performance analysis and comparison about the advantage and disadvantage of these 5 different algorithms are presented later. And at last a conclusion is drawn about the recommendation for these algorithms in different scenarios.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCGI.2007.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Designing proper algorithm is necessary for applications that query and analyze mass-information for high efficiency in various information services. In this paper, we discuss weighted information retrieval algorithms for an newly service, onsite object service. Four retrieval algorithms with one-dimension weight and one retrieval algorithm with multi-dimension weight are proposed to address the requirements of OOS. Detailed performance analysis and comparison about the advantage and disadvantage of these 5 different algorithms are presented later. And at last a conclusion is drawn about the recommendation for these algorithms in different scenarios.
现场对象服务的加权信息检索算法
为了在各种信息服务中实现高效的查询和分析,需要设计合适的算法。本文讨论了一种新型服务——现场对象服务的加权信息检索算法。针对OOS的要求,提出了四种一维权值检索算法和一种多维权值检索算法。随后对这5种算法的性能进行了详细的分析和优缺点比较。最后对这些算法在不同场景下的推荐进行了总结。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信