http://10.10.120.238:8080/xmlui/handle/123456789/276
Title: | A Semi-automated Approach to Generate an Adaptive Quality Attribute Relationship Matrix |
Authors: | Shah U. Patel S. Jinwala D. |
Keywords: | Quality Attribute Relationship Matrix Quality ontology Requirements Engineering |
Issue Date: | 2020 |
Publisher: | Springer |
Abstract: | [Context and Motivation] A critical success factor in Requirements Engineering (RE) involves recognizing conflicts in Quality Requirements (QRs). Nowadays, Quality Attributes Relationship Matrix (QARM) is utilized to identify the conflicts in QRs. The static QARM represents how one Quality Attribute (QA) undermines or supports to achieve other QAs. [Question/Problem] However, emerging technology discovers new QAs. Requirements analysts need to invest significant time and non-trivial human effort to acquire knowledge for the newly discovered QAs and influence among them. This process involves searching and analyzing a large set of quality documents from literature and industries. In addition, the use of static QARMs, without knowing the purpose of the QRs in the system may lead to false conflict identification. Rather than taking all QAs, domain-specific QAs are of great concern for the system being developed. [Principal ideas/results] In this paper, we propose an approach which is aimed to build an adaptive QARM semi-automatically. We empirically evaluate the approach and report an analysis of the generated QARM. We achieve 85.67% recall, 59.07% precision and 69.14% F-measure to acquire knowledge for QAs. [Contributions] We provide an algorithm to acquire knowledge for domain-specific QAs and construct an adaptive QARM from available unconstrained natural language documents and web search engines. © 2020, Springer Nature Switzerland AG. |
URI: | https://dx.doi.org/10.1007/978-3-030-44429-7_17 http://localhost:8080/xmlui/handle/123456789/276 |
ISBN: | 978-3030444280 |
ISSN: | 0302-9743 |
Appears in Collections: | Conference Paper |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.