信息检索算法检索性能评价指标的数学研究

Song Jun-feng, Zhang Wei-ming, Xiao Wei-dong
{"title":"信息检索算法检索性能评价指标的数学研究","authors":"Song Jun-feng, Zhang Wei-ming, Xiao Wei-dong","doi":"10.1109/ITCC.2005.14","DOIUrl":null,"url":null,"abstract":"Retrieval performance evaluation measures of information retrieval algorithm are the foundation of evaluating and improving information retrieval algorithm. In this paper precision and recall are analyzed mathematically, and a theorem is proved: a good IR algorithm will make precision and recall to be maximal at the same time in an ideal vector space, then a new general evaluation measure based on this theorem is proposed to evaluate information retrieval algorithm.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"500 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A mathematical investigation on retrieval performance evaluation measures of information retrieval algorithm\",\"authors\":\"Song Jun-feng, Zhang Wei-ming, Xiao Wei-dong\",\"doi\":\"10.1109/ITCC.2005.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Retrieval performance evaluation measures of information retrieval algorithm are the foundation of evaluating and improving information retrieval algorithm. In this paper precision and recall are analyzed mathematically, and a theorem is proved: a good IR algorithm will make precision and recall to be maximal at the same time in an ideal vector space, then a new general evaluation measure based on this theorem is proposed to evaluate information retrieval algorithm.\",\"PeriodicalId\":326887,\"journal\":{\"name\":\"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II\",\"volume\":\"500 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2005.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2005.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

信息检索算法的检索性能评价指标是评价和改进信息检索算法的基础。本文对信息检索算法的查准率和查全率进行了数学分析,并证明了一个定理:一个好的IR算法在理想向量空间中会使查准率和查全率同时达到最大,然后基于该定理提出了一个新的通用评价测度来评价信息检索算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A mathematical investigation on retrieval performance evaluation measures of information retrieval algorithm
Retrieval performance evaluation measures of information retrieval algorithm are the foundation of evaluating and improving information retrieval algorithm. In this paper precision and recall are analyzed mathematically, and a theorem is proved: a good IR algorithm will make precision and recall to be maximal at the same time in an ideal vector space, then a new general evaluation measure based on this theorem is proposed to evaluate information retrieval algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信