Using CBR and CART to predict maintainability of relational database-driven software applications

  • Authors:
  • Mehwish Riaz;Emilia Mendes;Ewan Tempero;Muhammad Sulayman

  • Affiliations:
  • The University of Auckland, New Zealand;School of Computing, Blekinge Institute of Technology, Sweden;The University of Auckland, New Zealand;The University of Auckland, New Zealand

  • Venue:
  • Proceedings of the 17th International Conference on Evaluation and Assessment in Software Engineering
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Background: Relational database-driven software applications have gained significant importance in modern software development. Given that software maintainability is an important quality attribute, predicting these applications' maintainability can provide various benefits to software organizations, such as adopting a defensive design and more informed resource management. Aims: The aim of this paper is to present the results from employing two well-known prediction techniques to estimate the maintainability of relational database-driven applications. Method: Case-based reasoning (CBR) and classification and regression trees (CART) were applied to data gathered on 56 software projects from software companies. The projects concerned development and/or maintenance of relational database-driven applications. Unlike previous studies, all variables (28 independent and 1 dependent) were measured on a 5-point bi-polar scale. Results: Results showed that CBR performed slightly better (at 76.8% correct predictions) in terms of prediction accuracy when compared to CART (67.8%). In addition, the two important predictors identified were documentation quality and understandability of the applications. Conclusions: The results show that CBR can be used by software companies to formalize and improve their process of maintainability prediction. Future work involves gathering more data and also employing other prediction techniques.