An Analysis of Software Bug Reports Using Random Forest

被引:1
|
作者
Ha Manh Tran [1 ]
Sinh Van Nguyen [1 ]
Synh Viet Uyen Ha [1 ]
Thanh Quoc Le [1 ]
机构
[1] Vietnam Natl Univ, Int Univ, Comp Sci & Engn, Ho Chi Minh City, Vietnam
关键词
Random forest; Decision tree; Software bug report; Network fault detection; Fault management; FAULT-TREE ANALYSIS; SEARCH;
D O I
10.1007/978-3-030-03192-3_21
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Bug tracking systems manage bug reports for assuring the quality of software products. A bug report also referred as trouble, problem, ticket or defect contains several features for problem management and resolution purposes. Severity and priority are two essential features of a bug report that define the effect level and fixing order of the bug. Determining these features is challenging and depends heavily on human being, e.g., software developers or system operators, especially for assessing a large number of error and warning events occurring on software products or network services. This study proposes an approach of using random forest for assessing severity and priority for software bug reports automatically. This approach aims at constructing multiple decision trees based on the subsets of the existing bug dataset and features, and then selecting the best decision trees to assess the severity and priority of new bugs. The approach can be applied for detecting and forecasting faults in large, complex communication networks and distributed systems today. We have presented the applicability of random forest for bug report analysis and performed several experiments on software bug datasets obtained from open source bug tracking systems. Random forest yields an average accuracy score of 0.75 that can be sufficient for assisting system operators in determining these features. We have provided some analysis of the experimental results.
引用
收藏
页码:273 / 285
页数:13
相关论文
共 50 条
  • [41] Using Cluster Analysis for Characteristics Detection in Software Defect Reports
    Gromova, Anna
    ANALYSIS OF IMAGES, SOCIAL NETWORKS AND TEXTS, AIST 2017, 2018, 10716 : 152 - 163
  • [42] TRAM: An Approach for Assigning Bug Reports using their Metadata
    Banitaan, Shadi
    Alenezi, Mamdouh
    2013 THIRD INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND INFORMATION TECHNOLOGY (ICCIT), 2013, : 215 - 219
  • [43] Improving Bug Localization using Correlations in Crash Reports
    Wang, Shaohua
    Khomh, Foutse
    Zou, Ying
    2013 10TH IEEE WORKING CONFERENCE ON MINING SOFTWARE REPOSITORIES (MSR), 2013, : 247 - 256
  • [44] Predicting Severity of Bug Reports using Implicit Tags
    Kao, Wei-Chen
    Lee, Chao-Yuan
    Yang, Chih-Chuan
    Yang, Cheng-Zen
    INTELLIGENT SYSTEMS AND APPLICATIONS (ICS 2014), 2015, 274 : 1846 - 1855
  • [45] Improving bug management using correlations in crash reports
    Shaohua Wang
    Foutse Khomh
    Ying Zou
    Empirical Software Engineering, 2016, 21 : 337 - 367
  • [46] Improving bug management using correlations in crash reports
    Wang, Shaohua
    Khomh, Foutse
    Zou, Ying
    EMPIRICAL SOFTWARE ENGINEERING, 2016, 21 (02) : 337 - 367
  • [47] Predicting the Severity of Bug Reports using Classification Algorithms
    Pushpalatha, M. N.
    Mrunalini, M.
    2016 INTERNATIONAL CONFERENCE ON CIRCUITS, CONTROLS, COMMUNICATIONS AND COMPUTING (I4C), 2016,
  • [48] Filtering Bug Reports for Fix-Time Analysis
    Lamkanfi, Ahmed
    Demeyer, Serge
    2012 16TH EUROPEAN CONFERENCE ON SOFTWARE MAINTENANCE AND REENGINEERING (CSMR), 2012, : 379 - 383
  • [49] Statistical Analysis of Refactoring Bug Reports in Eclipse Bugzilla
    Lacker, Eric
    Kim, Jongwook
    Kumar, Akash
    Chandrashekar, Lipika
    Paramaiahgari, Srilaxmi
    Howard, Jasmine
    2021 36TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING WORKSHOPS (ASEW 2021), 2021, : 9 - 13
  • [50] Performance-Aware Approach for Software Risk Management Using Random Forest Algorithm
    Aggarwal, Alankrita
    Dhindsa, Kanwalvir Singh
    Suri, P. K.
    INTERNATIONAL JOURNAL OF SOFTWARE INNOVATION, 2021, 9 (01) : 12 - 19