arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.08906cs.SE
收藏

基于关联规则挖掘的缺陷分配中冗余规则的减少

Reduction of Redundant Rules in Association Rule Mining-Based Bug Assignment

Meera Sharma, Abhishek Tandon, Madhu Kumari, V B Singh

摘要:

错误分类是一个决定如何处理新出现的错误报告的过程。在本文中,我们挖掘关联规则预测的错误受让人的一个新报告的错误使用不同的错误属性,即严重性,优先级,组件和操作系统。为了解决大数据集的问题,我们采用K均值聚类算法对大数据集进行划分,从而得到数据集的子集。我们使用MATLAB中的Apriori算法来生成关联规则。我们提取了每个簇中前5个分配者的关联规则,并在Mozilla开源软件项目的14696个bug报告上进行了实证验证。所提出的方法提供了一个改进的缺陷分配问题的现有技术。

英文摘要:

Bug triaging is a process to decide what to do with newly coming bug reports. In this paper, we have mined association rules for the prediction of bug assignee of a newly reported bug using different bug attributes, namely, severity, priority, component and operating system. To deal with the problem of large data sets, we have taken subsets of data set by dividing the large data set using K-means clustering algorithm. We have used an Apriori algorithm in MATLAB to generate association rules. We have extracted the association rules for top 5 assignees in each cluster.The proposed method has been empirically validated on 14696 bug reports of Mozilla open source software project, namely, Seamonkey, Firefox and Bugzilla. The proposed method provides an improvement over the existing techniques for bug assignment problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑