%0 Journal Article %1 Burgess:2001:IST %A Burgess, Colin J. %A Lefley, Martin %D 2001 %J Information and Software Technology %K Case-based Machine Neural Software algorithms, effort estimation genetic learning, networks, programming, reasoning, %N 14 %P 863--873 %R doi:10.1016/S0950-5849(01)00192-6 %T Can genetic programming improve software effort estimation? A comparative evaluation %U http://www.sciencedirect.com/science/article/B6V0B-44D4196-7/1/20f45986fc0a4827ad09169178379d73 %V 43 %X Accurate software effort estimation is an important part of the software process. Originally, estimation was performed using only human expertise, but more recently, attention has turned to a variety of machine learning (ML) methods. This paper attempts to evaluate critically the potential of genetic programming (GP) in software effort estimation when compared with previously published approaches, in terms of accuracy and ease of use. The comparison is based on the well-known Desharnais data set of 81 software projects derived from a Canadian software house in the late 1980s. The input variables are restricted to those available from the specification stage and significant effort is put into the GP and all of the other solution strategies to offer a realistic and fair comparison. There is evidence that GP can offer significant improvements in accuracy but this depends on the measure and interpretation of accuracy used. GP has the potential to be a valid additional tool for software effort estimation but set up and running effort is high and interpretation difficult, as it is for any complex meta-heuristic technique.

@article{Burgess:2001:IST, abstract = {Accurate software effort estimation is an important part of the software process. Originally, estimation was performed using only human expertise, but more recently, attention has turned to a variety of machine learning (ML) methods. This paper attempts to evaluate critically the potential of genetic programming (GP) in software effort estimation when compared with previously published approaches, in terms of accuracy and ease of use. The comparison is based on the well-known Desharnais data set of 81 software projects derived from a Canadian software house in the late 1980s. The input variables are restricted to those available from the specification stage and significant effort is put into the GP and all of the other solution strategies to offer a realistic and fair comparison. There is evidence that GP can offer significant improvements in accuracy but this depends on the measure and interpretation of accuracy used. GP has the potential to be a valid additional tool for software effort estimation but set up and running effort is high and interpretation difficult, as it is for any complex meta-heuristic technique.}, abstract-url = {http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=1000586}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Burgess, Colin J. and Lefley, Martin}, biburl = {https://www.bibsonomy.org/bibtex/2fa6e9b8246add3b154acd297708a68b5/brazovayeye}, doi = {doi:10.1016/S0950-5849(01)00192-6}, interhash = {f405f071ec6316bf3bf372347f205ded}, intrahash = {fa6e9b8246add3b154acd297708a68b5}, journal = {Information and Software Technology}, keywords = {Case-based Machine Neural Software algorithms, effort estimation genetic learning, networks, programming, reasoning,}, number = 14, pages = {863--873}, timestamp = {2008-06-19T17:37:08.000+0200}, title = {Can genetic programming improve software effort estimation? {A} comparative evaluation}, url = {http://www.sciencedirect.com/science/article/B6V0B-44D4196-7/1/20f45986fc0a4827ad09169178379d73}, volume = 43, year = 2001 }