On the value of ensemble effort estimation
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal
|Journal / Publication||IEEE Transactions on Software Engineering|
|Publication status||Published - 2012|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-84870566084&origin=recordpage|
Background: Despite decades of research, there is no consensus on which software effort estimation methods produce the most accurate models. Aim: Prior work has reported that, given M estimation methods, no single method consistently outperforms all others. Perhaps rather than recommending one estimation method as best, it is wiser to generate estimates from ensembles of multiple estimation methods. Method: Nine learners were combined with 10 preprocessing options to generate 9 × 10 = 90 solo methods. These were applied to 20 datasets and evaluated using seven error measures. This identified the best n (in our case n=13) solo methods that showed stable performance across multiple datasets and error measures. The top 2, 4, 8, and 13 solo methods were then combined to generate 12 multimethods, which were then compared to the solo methods. Results: 1) The top 10 (out of 12) multimethods significantly outperformed all 90 solo methods. 2) The error rates of the multimethods were significantly less than the solo methods. 3) The ranking of the best multimethod was remarkably stable. Conclusion: While there is no best single effort estimation method, there exist best combinations of such effort estimation methods. © 2012 IEEE.
- analogy, ensemble, k-NN, machine learning, neural nets, regression trees, Software cost estimation, support vector machines