异构词的结果处理

Guangkun Sun, Jianzhong Li
{"title":"异构词的结果处理","authors":"Guangkun Sun, Jianzhong Li","doi":"10.1109/ITCC.2002.1000389","DOIUrl":null,"url":null,"abstract":"Distributed digital libraries allow users to access data of different modalities, from different information sources, and ranked by different criteria. Most applications make too many assumptions, and need too much information. We assume that each information retrieval model is satisfactory in its own context. Based on this assumption, we propose two results processing methods: Ranking by Sources (RBS) and Simply Merging Results (SMR). In RBS, we define satisfied ranking, which is the ranking satisfying most source rankings, and satisfied distance, which indicates how a specific source ranking suits the satisfied ranking. RBS groups the results by the ranked sources, which is sorted by their satisfied distances. In SMR, for each result, we substitute the normalized score for its original scores, and then merge them using normalized scores. The experiment showed that our methods are very feasible in the rapid expanding distributed digital libraries.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Results processing in a heterogeneous word\",\"authors\":\"Guangkun Sun, Jianzhong Li\",\"doi\":\"10.1109/ITCC.2002.1000389\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed digital libraries allow users to access data of different modalities, from different information sources, and ranked by different criteria. Most applications make too many assumptions, and need too much information. We assume that each information retrieval model is satisfactory in its own context. Based on this assumption, we propose two results processing methods: Ranking by Sources (RBS) and Simply Merging Results (SMR). In RBS, we define satisfied ranking, which is the ranking satisfying most source rankings, and satisfied distance, which indicates how a specific source ranking suits the satisfied ranking. RBS groups the results by the ranked sources, which is sorted by their satisfied distances. In SMR, for each result, we substitute the normalized score for its original scores, and then merge them using normalized scores. The experiment showed that our methods are very feasible in the rapid expanding distributed digital libraries.\",\"PeriodicalId\":115190,\"journal\":{\"name\":\"Proceedings. International Conference on Information Technology: Coding and Computing\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Conference on Information Technology: Coding and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2002.1000389\",\"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. International Conference on Information Technology: Coding and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2002.1000389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

分布式数字图书馆允许用户访问来自不同信息源的不同形式的数据,并根据不同的标准进行排序。大多数应用程序做了太多的假设,需要太多的信息。我们假设每个信息检索模型在其各自的上下文中都是令人满意的。基于这一假设,我们提出了两种结果处理方法:按来源排序(RBS)和简单合并结果(SMR)。在RBS中,我们定义了满意排名,即满足大多数来源排名的排名,以及满意距离,表示特定来源排名与满意排名的匹配程度。RBS根据排名来源对结果进行分组,排名来源根据他们满意的距离进行排序。在SMR中,对于每个结果,我们用归一化分数代替其原始分数,然后使用归一化分数合并它们。实验表明,该方法在快速发展的分布式数字图书馆中是可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Results processing in a heterogeneous word
Distributed digital libraries allow users to access data of different modalities, from different information sources, and ranked by different criteria. Most applications make too many assumptions, and need too much information. We assume that each information retrieval model is satisfactory in its own context. Based on this assumption, we propose two results processing methods: Ranking by Sources (RBS) and Simply Merging Results (SMR). In RBS, we define satisfied ranking, which is the ranking satisfying most source rankings, and satisfied distance, which indicates how a specific source ranking suits the satisfied ranking. RBS groups the results by the ranked sources, which is sorted by their satisfied distances. In SMR, for each result, we substitute the normalized score for its original scores, and then merge them using normalized scores. The experiment showed that our methods are very feasible in the rapid expanding distributed digital libraries.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Parallel execution of relational algebra operator under distributed database systems Enhancing watermark robustness through mixture of watermarked digital objects Improving precision and recall for Soundex retrieval Performance driven circuit clustering and partitioning Experimental results towards content-based sub-image retrieval
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1