Automatic Feature Selection by Regularization to Improve Bug Prediction Accuracy

Osman, Haidar; Ghafari, Mohammad; Nierstrasz, Oscar Marius (21 February 2017). Automatic Feature Selection by Regularization to Improve Bug Prediction Accuracy. In: 1st international Workshop on Machine Learning Techniques for Software Quality Evaluation. Klagenfurt, Austria. 21. Feb. 2017. 10.1109/MALTESQUE.2017.7882013

Text Osma17c-bugPredictionRegularization.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (188kB) | Request a copy

Bug prediction has been a hot research topic for the past two decades, during which different machine learning models based on a variety of software metrics have been proposed. Feature selection is a technique that removes noisy and redundant features to improve the accuracy and generalizability of a prediction model. Although feature selection is important, it adds yet another step to the process of building a bug prediction model and increases its complexity. Recent advances in machine learning introduce embedded feature selection methods that allow a prediction model to carry out feature selection automatically as part of the training process. The effect of these methods on bug prediction is unknown. In this paper we study regularization as an embedded feature selection method in bug prediction models. Specifically, we study the impact of three regularization methods (Ridge, Lasso, and ElasticNet) on linear and Poisson Regression as bug predictors for five open source Java systems. Our results show that the three regularization methods reduce the prediction error of the regressors and improve their stability

Interest & Impact

Downloads

0 since deposited on 11 Apr 2018
0 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item