{"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}
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.