Towards more accurate retrieval of duplicate bug reports.
ASE(2011)
摘要
ABSTRACTIn a bug tracking system, different testers or users may submit multiple reports on the same bugs, referred to as duplicates, which may cost extra maintenance efforts in triaging and fixing bugs. In order to identify such duplicates accurately, in this paper we propose a retrieval function (REP) to measure the similarity between two bug reports. It fully utilizes the information available in a bug report including not only the similarity of textual content in summary and description fields, but also similarity of non-textual fields such as product, component, version, etc. For more accurate measurement of textual similarity, we extend BM25F - an effective similarity formula in information retrieval community, specially for duplicate report retrieval. Lastly we use a two-round stochastic gradient descent to automatically optimize REP for specific bug repositories in a supervised learning manner. We have validated our technique on three large software bug repositories from Mozilla, Eclipse and OpenOffice. The experiments show 10 -- 27% relative improvement in recall [email protected] and 17 -- 23% relative improvement in mean average precision over our previous model. We also applied our technique to a very large dataset consisting of 209,058 reports from Eclipse, resulting in a recall [email protected] of 37 -- 71% and mean average precision of 47%.
更多查看译文
关键词
gradient methods,information retrieval,learning (artificial intelligence),program debugging,BM25F,REP,bug tracking system,duplicate bug reports,duplicate report retrieval,information retrieval community,retrieval function,software bug repositories,supervised learning,textual similarity,two-round stochastic gradient descent,
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络