A Timeline Optimization Approach of Green Requirement Engineering Framework for Efficient Categorized Natural Language Documents in Non-Functional Requirements

A Timeline Optimization Approach of Green Requirement Engineering Framework for Efficient Categorized Natural Language Documents in Non-Functional Requirements

K. Mahalakshmi, Udayakumar Allimuthu, L Jayakumar, Ankur Dumka
Copyright: © 2021 |Pages: 17
DOI: 10.4018/IJBAN.2021010102
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The system's functional requirements (FR) and non-functional requirements (NFR) are derived from the software requirements specification (SRS). The requirement specification is challenging in classification process of FR and NFR requirements. To overcome these issues, the work contains various significant contributions towards SRS, such as green requirements engineering (GRE), to achieve the natural language processing, requirement specification, extraction, classification, requirement specification, feature selection, and testing the quality attributes improvement of NFRs. In addition to this, the test pad-based quality study to determine accuracy, quality, and condition providence to the classification of non-functional requirements (NFR) is also carried out. The resulted classification accuracy was implemented in the MATLAB R2014; the resulted graphical record shows the efficient non-functional requirements (NFR) classification with green requirements engineering (GRE) framework.
Article Preview
Top

2. Literature Review

Ghazarian et al. (2011) described about the requirements specification framework for pattern-orientation of the software. They overcome the challenges behind the pattern-orientation by using Problem Decomposition Scheme (PDS), establish and decompose the theoretic classification problem by classification scheme. Finally their proposed system PDS-based requirements specification framework is shown to achieve a high degree of requirements pattern recognition consistency across developers.

John.S and Laurie.W have dealt with Automated Extraction of NFRs from the unconstrained natural language documents by using automated natural language processing. Their proposed system categorizes NFRs as in 14 main categories for identify and classify NFR statements as effective manner by NFR locator. This locator used to natural language parsing and classifies sentences by using k nearest neighbour classifier with the support vector machine algorithm (applied twice) (Mahalakshmi & Prabhakar, 2015) (Mahalakshmi et al., 2014a). These proposed systems are outperforming the best result F measure of 0.54 and the optimal naïve Bayes classifier F-measure of 0.32.

Complete Article List

Search this Journal:
Reset
Volume 11: 1 Issue (2024)
Volume 10: 1 Issue (2023)
Volume 9: 6 Issues (2022): 4 Released, 2 Forthcoming
Volume 8: 4 Issues (2021)
Volume 7: 4 Issues (2020)
Volume 6: 4 Issues (2019)
Volume 5: 4 Issues (2018)
Volume 4: 4 Issues (2017)
Volume 3: 4 Issues (2016)
Volume 2: 4 Issues (2015)
Volume 1: 4 Issues (2014)
View Complete Journal Contents Listing