Bug prediction using entropy-based measures Online publication date: Mon, 17-Feb-2014
by K.K. Chaturvedi; V.B. Singh
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 2, No. 4, 2013
Abstract: In the available literature, researchers have proposed and implemented a plethora of bug prediction approaches, which vary in terms of accuracy, complexity and the input data they require, but very few of them has predicted the number of bugs in the software based on the entropy or the complexity of code changes. To use the entropy of code change as a bug predictor, firstly, the history of complexity metric (HCM) defined with different decay weight and decay models were assigned to it (Hassan, 2009). But, they did not propose any method to find out the value of decay rate/factor. In this paper, we proposed a new weight to HCM, a method to find out the value of decay rate/factor and proposed some novel decay-based methods. We have applied simple linear regression (SLR) and support vector regression (SVR) to predict the bugs based on existing and proposed methods of HCM. We have also studied the performance of different complexity of code changes (entropy)-based bug prediction approaches on the basis of various performance measures using four subsystems of Mozilla project. We found that decay models for SVR show better results in comparison with SLR.
Online publication date: Mon, 17-Feb-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com