KSAP: An approach to bug report assignment using KNN search and heterogeneous proximity
文献类型：期刊论文
| 作者 | Zhang, W ; Wang, S ; Wang, Q |
| 刊名 | INFORMATION AND SOFTWARE TECHNOLOGY
 |
| 出版日期 | 2016 |
| 卷号 | 70页码:68-84 |
| 关键词 | Bug report assignment Heterogeneous network Heterogeneous proximity Developer recommendation |
| ISSN号 | 0950-5849 |
| 中文摘要 | Context: Bug report assignment, namely, to assign new bug reports to developers for timely and effective bug resolution, is crucial for software quality assurance. However, with the increasing size of software system, it is difficult to assign bugs to appropriate developers for bug managers. Objective: This paper propose an approach, called KSAP (K-nearest-neighbor search and heterogeneous proximity), to improve automatic bug report assignment by using historical bug reports and heterogeneous network of bug repository. Method: When a new bug report was submitted to the bug repository, KSAP assigns developers for the bug report by using a two-phase procedure. The first phase is to search historically-resolved similar bug reports to the new bug report by K-nearest-neighbor (KNN) method. The second phase is to rank the developers who contributed to those similar bug reports by heterogeneous proximity. Results: We collected bug repositories of Mozilla, Eclipse, Apache Ant and Apache Tomcat6 projects to investigate the performance of the proposed KSAP approach. Experimental results demonstrate that KSAP can improve the recall of bug report assignment between 7.5-32.25% in comparison with the state of art techniques. When there is only a small number of developer collaborations on common bug reports, KSAP has shown its excellence over other sate of art techniques. When we tune the parameters of the number of historically-resolved similar bug reports (K) and the number of developers (Q) for recommendation, KSAP keeps its superiority steadily. Conclusion: This is the first paper to demonstrate how to automatically build heterogeneous network of a bug repository and extract meta-paths of developer collaborations from the heterogeneous network for bug report assignment. (C) 2015 Elsevier B.V. All rights reserved. |
| 英文摘要 | Context: Bug report assignment, namely, to assign new bug reports to developers for timely and effective bug resolution, is crucial for software quality assurance. However, with the increasing size of software system, it is difficult to assign bugs to appropriate developers for bug managers. Objective: This paper propose an approach, called KSAP (K-nearest-neighbor search and heterogeneous proximity), to improve automatic bug report assignment by using historical bug reports and heterogeneous network of bug repository. Method: When a new bug report was submitted to the bug repository, KSAP assigns developers for the bug report by using a two-phase procedure. The first phase is to search historically-resolved similar bug reports to the new bug report by K-nearest-neighbor (KNN) method. The second phase is to rank the developers who contributed to those similar bug reports by heterogeneous proximity. Results: We collected bug repositories of Mozilla, Eclipse, Apache Ant and Apache Tomcat6 projects to investigate the performance of the proposed KSAP approach. Experimental results demonstrate that KSAP can improve the recall of bug report assignment between 7.5-32.25% in comparison with the state of art techniques. When there is only a small number of developer collaborations on common bug reports, KSAP has shown its excellence over other sate of art techniques. When we tune the parameters of the number of historically-resolved similar bug reports (K) and the number of developers (Q) for recommendation, KSAP keeps its superiority steadily. Conclusion: This is the first paper to demonstrate how to automatically build heterogeneous network of a bug repository and extract meta-paths of developer collaborations from the heterogeneous network for bug report assignment. (C) 2015 Elsevier B.V. All rights reserved. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000367697600006 |
| 公开日期 | 2016-12-13 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/17410]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Zhang, W,Wang, S,Wang, Q. KSAP: An approach to bug report assignment using KNN search and heterogeneous proximity[J]. INFORMATION AND SOFTWARE TECHNOLOGY,2016,70:68-84. |
| APA | Zhang, W,Wang, S,&Wang, Q.(2016).KSAP: An approach to bug report assignment using KNN search and heterogeneous proximity.INFORMATION AND SOFTWARE TECHNOLOGY,70,68-84. |
| MLA | Zhang, W,et al."KSAP: An approach to bug report assignment using KNN search and heterogeneous proximity".INFORMATION AND SOFTWARE TECHNOLOGY 70(2016):68-84. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。