A comparative study for estimating software development effort intervals |
| |
Authors: | Ay?e?Bak?r author-information" > author-information__contact u-icon-before" > mailto:ayse.bakir@boun.edu.tr" title=" ayse.bakir@boun.edu.tr" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,Burak?Turhan,Ay?e?Bener |
| |
Affiliation: | 1.Department of Computer Engineering,Bo?azi?i University,Bebek, Istanbul,Turkey;2.Department of Information Processing Science,University of Oulu,Oulu,Finland;3.Ted Rogers School of Information Technology Management,Ryerson University,Toronto,Canada |
| |
Abstract: | Software cost/effort estimation is still an open challenge. Many researchers have proposed various methods that usually focus on point estimates. Until today, software cost estimation has been treated as a regression problem. However, in order to prevent overestimates and underestimates, it is more practical to predict the interval of estimations instead of the exact values. In this paper, we propose an approach that converts cost estimation into a classification problem and that classifies new software projects in one of the effort classes, each of which corresponds to an effort interval. Our approach integrates cluster analysis with classification methods. Cluster analysis is used to determine effort intervals while different classification algorithms are used to find corresponding effort classes. The proposed approach is applied to seven public datasets. Our experimental results show that the hit rate obtained for effort estimation are around 90–100%, which is much higher than that obtained by related studies. Furthermore, in terms of point estimation, our results are comparable to those in the literature although a simple mean/median is used for estimation. Finally, the dynamic generation of effort intervals is the most distinctive part of our study, and it results in time and effort gain for project managers through the removal of human intervention. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|