2013 21st IEEE International Requirements Engineering Conference (RE) (2012)
Chicago, IL, USA USA
Sept. 24, 2012 to Sept. 28, 2012
Nan Niu , Department of Computer Science and Engineering, Mississippi State University, USA
Anas Mahmoud , Department of Computer Science and Engineering, Mississippi State University, USA
Modern requirements tracing tools employ information retrieval methods to automatically generate candidate links. Due to the inherent trade-off between recall and precision, such methods cannot achieve a high coverage without also retrieving a great number of false positives, causing a significant drop in result accuracy. In this paper, we propose an approach to improving the quality of candidate link generation for the requirements tracing process. We base our research on the cluster hypothesis which suggests that correct and incorrect links can be grouped in high-quality and low-quality clusters respectively. Result accuracy can thus be enhanced by identifying and filtering out low-quality clusters. We describe our approach by investigating three open-source datasets, and further evaluate our work through an industrial study. The results show that our approach outperforms a baseline pruning strategy and that improvements are still possible.
clustering, traceability, requirements tracing
Nan Niu, Anas Mahmoud, "Enhancing candidate link generation for requirements tracing: The cluster hypothesis revisited", 2013 21st IEEE International Requirements Engineering Conference (RE), vol. 00, no. , pp. 81-90, 2012, doi:10.1109/RE.2012.6345842