TY - GEN
T1 - A semantic relatedness approach for traceability link recovery
AU - Mahmoud, Anas
AU - Niu, Nan
AU - Xu, Songhua
PY - 2012
Y1 - 2012
N2 - Human analysts working with automated tracing tools need to directly vet candidate traceability links in order to determine the true traceability information. Currently, human intervention happens at the end of the traceability process, after candidate traceability links have already been generated. This often leads to a decline in the results' accuracy. In this paper, we propose an approach, based on semantic relatedness (SR), which brings human judgment to an earlier stage of the tracing process by integrating it into the underlying retrieval mechanism. SR tries to mimic human mental model of relevance by considering a broad range of semantic relations, hence producing more semantically meaningful results. We evaluated our approach using three datasets from different application domains, and assessed the tracing results via six different performance measures concerning both result quality and browsability. The empirical evaluation results show that our SR approach achieves a significantly better performance in recovering true links than a standard Vector Space Model (VSM) in all datasets. Our approach also achieves a significantly better precision than Latent Semantic Indexing (LSI) in two of our datasets.
AB - Human analysts working with automated tracing tools need to directly vet candidate traceability links in order to determine the true traceability information. Currently, human intervention happens at the end of the traceability process, after candidate traceability links have already been generated. This often leads to a decline in the results' accuracy. In this paper, we propose an approach, based on semantic relatedness (SR), which brings human judgment to an earlier stage of the tracing process by integrating it into the underlying retrieval mechanism. SR tries to mimic human mental model of relevance by considering a broad range of semantic relations, hence producing more semantically meaningful results. We evaluated our approach using three datasets from different application domains, and assessed the tracing results via six different performance measures concerning both result quality and browsability. The empirical evaluation results show that our SR approach achieves a significantly better performance in recovering true links than a standard Vector Space Model (VSM) in all datasets. Our approach also achieves a significantly better precision than Latent Semantic Indexing (LSI) in two of our datasets.
KW - automated tracing
KW - experimentation
KW - information search and retrieval
KW - semantic relatedness
UR - http://www.scopus.com/inward/record.url?scp=84864970133&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864970133&partnerID=8YFLogxK
U2 - 10.1109/icpc.2012.6240487
DO - 10.1109/icpc.2012.6240487
M3 - Conference contribution
AN - SCOPUS:84864970133
SN - 9781467312165
T3 - IEEE International Conference on Program Comprehension
SP - 183
EP - 192
BT - 2012 20th IEEE International Conference on Program Comprehension, ICPC 2012 - Proceedings
PB - IEEE Computer Society
T2 - 2012 20th IEEE International Conference on Program Comprehension, ICPC 2012
Y2 - 11 June 2012 through 13 June 2012
ER -