Workshop on Empirical Requirements Engineering (EmpiRE 2011) 2011
DOI: 10.1109/empire.2011.6046255
|View full text |Cite
|
Sign up to set email alerts
|

Proximity-based traceability: An empirical validation using ranked retrieval and set-based measures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 31 publications
0
6
0
Order By: Relevance
“…Applications of IR to TLR are the most related to this work, and began with probabilistic [36], [38] and vector space models [39] to retrieve links between source code and documentation, as well as source code and requirements. Additionally, other IR approaches such as Latent Semantic Analysis (LSA) [5], probabilistic LSA (pLSA) [6], Jensen-Shannon (JS) [6], Latent Dirichlet Allocation (LDA) [7], and proximity-based VSM [8] have also been applied directly to the TLR task. Oliveto et al performed an empirical study of IR methods for TLR [17] comparing VSM, LSA, LDA, and JS via Principal Component Analysis, showing that VSM, LSA, and JS capture similar information, while information captured by LDA is unique.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Applications of IR to TLR are the most related to this work, and began with probabilistic [36], [38] and vector space models [39] to retrieve links between source code and documentation, as well as source code and requirements. Additionally, other IR approaches such as Latent Semantic Analysis (LSA) [5], probabilistic LSA (pLSA) [6], Jensen-Shannon (JS) [6], Latent Dirichlet Allocation (LDA) [7], and proximity-based VSM [8] have also been applied directly to the TLR task. Oliveto et al performed an empirical study of IR methods for TLR [17] comparing VSM, LSA, LDA, and JS via Principal Component Analysis, showing that VSM, LSA, and JS capture similar information, while information captured by LDA is unique.…”
Section: Related Workmentioning
confidence: 99%
“…Establishing traceability links between the artifacts of a system is extremely arduous and error-prone when performed manually. This has led to a large body of research proposing techniques that aid developers with this task [4], [5], [6], [7], [8]. However, establishing traceability links at one point in the lifetime of a software system is only part of the struggle.…”
Section: Introductionmentioning
confidence: 99%
“…Such activities tend to be costly to implement and are therefore perceived as financially nonviable by many companies [8], [15]. To address this problem, many efforts [16], [17], [18], [19], [20], [21], [22] have been devoted to semi-automatic or fullyautomatic trace link creation. However, the precision and recall of generated trace links is still at a low level of accuracy, such that the trace link creation throughout the entire systems development process, remains a challenging issue [23].…”
Section: Research Questionsmentioning
confidence: 99%
“…The study of automated tracing methods has resulted in much progress toward the automation of candidate trace link generation. Techniques using latent semantic analysis [11], key phrases [14], unsupervised learning [15], and term proximity [13] exploit the structural relationship between words in a document. The use of thesauri [10,16] and web queries [17] supplement trace link generation with external information to improve weak links.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Recall and precision are measures frequently used to evaluate the accuracy of a TM from a researcher's perspective [8,9,10,11,12], while measures such as lag, selectivity, and mean average precision have been used to evaluate the quality of a TM from an analyst's perspective [5,13]. In general, automated methods return candidate TMs ("candidate" until a human analyst vets them) with high recall and low precision.…”
Section: Introductionmentioning
confidence: 99%