The Analysis of Software Complexity Using Stochastic Metric Selection
The Journal of Pattern Recognition Research (JPRR) provides an international forum for the electronic publication of high-quality research and industrial experience articles in all areas of pattern recognition, machine learning, and artificial intelligence. JPRR is committed to rigorous yet rapid reviewing. Final versions are published electronically
(ISSN 1558-884X) immediately upon acceptance.
The Analysis of Software Complexity Using Stochastic Metric Selection
Nick J. Pizzi, Aleksander Demko, Witold Pedrycz
JPRR Vol 6, No 1 (2011); doi:10.13176/11.224 
Download
Nick J. Pizzi, Aleksander Demko, Witold Pedrycz
Abstract
The automated prediction of qualitative attributes such as software complexity is a desirable software engineering goal. A potential technique is to use software metrics as quantitative predictors for these kinds of attributes. We describe a pattern classification method where a large collection of classifiers is presented with randomly selected subsets of software metrics describing modules from a sophisticated biomedical data analysis system. The method identifies the software metric subset that has the highest discriminatory power vis-à-vis software complexity. That is, we identify the metric subset that is most effective at predicting this qualitative attribute. This pattern classification method is empirically evaluated and carefully validated against two benchmark approaches. We demonstrate that this method has utility in the automated prediction of software complexity using quantitative software measures.
JPRR Vol 6, No 1 (2011); doi:10.13176/11.224 | Full Text  | Share this paper: