KSAP: An approach to bug report assignment using KNN search and heterogeneous proximity

ISCAS OpenIR

	KSAP: An approach to bug report assignment using KNN search and heterogeneous proximity
	Zhang, W; Wang, S; Wang, Q
	2016
发表期刊	INFORMATION AND SOFTWARE TECHNOLOGY
ISSN	0950-5849
卷号	70 页码:68-84
摘要	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
关键词	Bug Report Assignment Heterogeneous Network Heterogeneous Proximity Developer Recommendation
部门归属	Beijing Univ Chem Technol, Sch Econ & Management, Beijing 100019, Peoples R China. Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada. Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100190, Peoples R China.
语种	英语
WOS记录号	WOS:000367697600006
引用统计
内容类型	期刊论文
URI标识	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.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
1-s2.0-S095058491500（1739KB）			开放获取	使用许可	请求全文