Trace Link Recovery Using Semantic Relation Graphs and Spreading Activation
| dc.contributor.author | Schlutter, Aaron | |
| dc.contributor.author | Vogelsang, Andreas | |
| dc.contributor.editor | Koziolek, Anne | |
| dc.contributor.editor | Schaefer, Ina | |
| dc.contributor.editor | Seidl, Christoph | |
| dc.date.accessioned | 2020-12-17T11:57:58Z | |
| dc.date.available | 2020-12-17T11:57:58Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | The paper was first published at the 28th IEEE International Requirements Engineering Conference in 2020. Trace Link Recovery tries to identify and link related existing requirements with each other to support further engineering tasks. Existing approaches are mainly based on algebraic Information Retrieval or machine-learning. Machine-learning approaches usually demand reasonably large and labeled datasets to train. Algebraic Information Retrieval approaches like distance between tf-idf scores also work on smaller datasets without training but are limited in providing explanations for trace links. In this work, we present a Trace Link Recovery approach that is based on an explicit representation of the content of requirements as a semantic relation graph and uses Spreading Activation to answer trace queries over this graph. Our approach is fully automated including an NLP pipeline to transform unrestricted natural language requirements into a graph. We evaluate our approach on five common datasets. Depending on the selected configuration, the predictive power strongly varies. With the best tested configuration, the approach achieves a mean average precision of 40% and a Lag of 50%. Even though the predictive power of our approach does not outperform state-of-the-art approaches, we think that an explicit knowledge representation is an interesting artifact to explore in Trace Link Recovery approaches to generate explanations and refine results. | en |
| dc.identifier.doi | 10.18420/SE2021_35 | |
| dc.identifier.isbn | 978-3-88579-704-3 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/34531 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software Engineering 2021 | |
| dc.relation.ispartofseries | ecture Notes in Informatics (LNI) - Proceedings, Volume P-310 | |
| dc.subject | Traceability | |
| dc.subject | Natural Language | |
| dc.subject | Semantic Relation Graph | |
| dc.subject | Spreading Activation | |
| dc.title | Trace Link Recovery Using Semantic Relation Graphs and Spreading Activation | en |
| dc.type | Text/ConferencePaper | |
| gi.citation.endPage | 96 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 95 | |
| gi.conference.date | 22.-26. Februar 2021 | |
| gi.conference.location | Braunschweig/Virtuell |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- B1-34.pdf
- Größe:
- 43.1 KB
- Format:
- Adobe Portable Document Format