A Graph Convolution Network-Based Bug Triage System to Learn Heterogeneous Graph Representation of Bug Reports

IEEE Access

Syed Farhan Alam Zaidi¹  Chan-Gun Lee²  Honguk Woo³ 

[1] Department of Computer Science and Engineering, CAU Institute of Innovative Talent of Big Data, Chung-Ang University, Seoul, South Korea;Department of Computer Science and Engineering, Chung-Ang University, Seoul, South Korea;Department of Software, Sungkyunkwan University, Suwon, South Korea;

关键词: Bug triage;    bug report;    software maintenance;    defect triage;    bug assignment;    bug report;   

DOI  :  10.1109/ACCESS.2022.3153075

来源: DOAJ

【 摘 要 】

Many bugs and defects occur during software testing and maintenance. These bugs should be resolved as soon as possible, to improve software quality. However, bug triage aims to solve these bugs by assigning the reported bugs to an appropriate developer or list of developers. It is an arduous task for a human triager to assign an appropriate developer to a bug report, when there are several developers with different skills, and several automated and semi-automated triage systems have been proposed in the last decade. Some recent techniques have suggested possibilities for the development of an effective triage system. However, these techniques require improvement. In previous work, we proposed a heterogeneous graph representation for bug triage, using word–word edges and word-bug document co-occurrences to build a heterogeneous graph of bug data. Cosine similarity is used to weight the word–word edges. Then, a graph convolution network is used to learn a heterogeneous graph representation. This paper extends our previous work by adopting different similarity metrics and correlation metrics for weighting word–word edges. The method was validated using different small and large datasets obtained from large-scale open-source projects. The top-k accuracy metric was used to evaluate the performance of the bug triage system. The experimental results showed that the point-wise mutual information of the proposed model was better than that of other word–word weighting methods, and our method had better accuracy for large datasets than other recent state-of-the-art methods. The proposed method with point-wise mutual information showed 3% to 6% higher top-1 accuracy than state-of-the-art methods for large datasets.

【 授权许可】

Unknown