A Machine Learning Algorithm Based on Inverse Problems for Software Requirements Selection
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 23, Issue 2
Abstract
This paper describes the software requirements prioritization task and provides a systematic approach to determine what needs to be included in the next release of a software product. Minimizing the total cost of adding a new feature in the next release and maximizing overall customer satisfaction are contradictory objectives. In this paper, first, an adaptive multi-objective prioritization model is discussed. Then we describe how discrete inverse problems ideas can in fact be formulated to obtain a smooth local “Added Degree of Importance” (ADI) function of client requirements which could be used to classify and prioritize the software requirements for next release. The numerical implementation of the proposed model with a case study on software requirements selection shows the effectiveness of the multi-objective inverse model (IM) approach. The proposed model have been compared with some of the recent relevant models. Main future of the model is that it has been designed by the assignment of a real score for each of the requirements unlike just classification provided in the literature.
Authors and Affiliations
Ali Sever
Keywords
Related Articles
- EP ID EP321940
- DOI 10.9734/JAMCS/2017/34622
- Views 117
- Downloads 0
General Version of Gauss-type Proximal Point Method and Its Uniform Convergence Analysis for Metrically Regular Mappings
We study the uniform convergence of the general version of Gauss-type proximal point algorithm (GG-PPA), introduced by Alom et al. [1], for solving the parametric generalized equations y ∈ T(x), where T : X 2Y is a set...
Multicyclic Codes and Algebraic Dynamical Systems
We present the structures within group algebras constructed from commutative groups and finite fields. Then we define and construct multicyclic codes in these group algebras. At the end, in the frame of the decoding proc...
Large Matrices Inversion Using the Basis Exchange Algorithm
Data exploration tasks often require inversion of large matrices. The paper presents a new method of matrices inversion, which uses the basis exchange algorithm controlled by the convex and piecewise linear (CPL) inversi...
Evaluation of Calinski-Harabasz Criterion as Fitness Measure for Genetic Algorithm Based Segmentation of Cervical Cell Nuclei
In this paper, the classi cation capability of Calinski-Harabasz criterion as an internal cluster validation measure has been evaluated for clustering-based region discrimination on cervical cells. In this approach, subr...
Some Fixed Point Theorems for Berinde-Type Contraction Mappings on Gp-Metric Spaces
In this paper, we de ne the concepts of (δ, 1 − δ)-weak contraction, (φ, 1 − δ)-weak contraction and Ciric-type almost contraction in the sense of Berinde in Gp-complete Gp-metric space. Furthermore, we prove the exist...