Choosing a Suitable Requirement Prioritization Method: A Survey

• URL: http://arxiv.org/abs/2402.13149v1
• Date: Tue, 20 Feb 2024 17:05:16 GMT
• Title: Choosing a Suitable Requirement Prioritization Method: A Survey
• Authors: Esraa Alhenawi, Shatha Awawdeh, Ruba Abu Khurma, Maribel Garc\'ia-Arenas, Pedro A. Castillo, Amjad Hudaib
• Abstract summary: Powerful requirements prioritization techniques are of paramount importance to finish the implementation on time and within budget. We propose a novel classification that can classify the prioritization techniques under two major classes: relative and exact prioritization techniques class. An overview of fifteen different requirements prioritization techniques are presented and organized according to the proposed classification criteria's.
• Score: 1.4155748588033552
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Software requirements prioritization plays a crucial role in software development. It can be viewed as the process of ordering requirements by determining which requirements must be done first and which can be done later. Powerful requirements prioritization techniques are of paramount importance to finish the implementation on time and within budget. Many factors affect requirement prioritization such as stakeholder expectations, complexity, dependency, scalability, risk, and cost. Therefore, finding the proper order of requirements is a challenging process. Hence, different types of requirements prioritization techniques have been developed to support this task. In this survey, we propose a novel classification that can classify the prioritization techniques under two major classes: relative and exact prioritization techniques class, where each class is divided into two subclasses. We depend in our classification on the way the value of ranking is given to the requirement, either explicitly as a specific value in the case of the exact prioritization techniques class, or implicitly in the case of the Relative prioritization technique class. An overview of fifteen different requirements prioritization techniques are presented and organized according to the proposed classification criteria's. Moreover, we make a comparison between methods that are related to the same subclass to analyze their strengths and weaknesses. Based on the comparison results, the properties for each proposed subclass of techniques are identified. Depending on these properties, we present some recommendations to help project managers in the process of selecting the most suitable technique to prioritize requirements based on their project characteristics (number of requirements, time, cost, and accuracy).

Related papers

• An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
  We first construct a max-margin optimization-based model to model potentially non-monotonic preferences. We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration. Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
  arXiv  Detail & Related papers  (2024-09-04T14:36:20Z)
• Towards an Approach to Pattern-based Domain-Specific Requirements Engineering [0.0]
  We propose the Pattern-based Domain-specific Requirements Engineering Approach for the specification of functional and performance requirements. This approach emerges from an academia-industry collaboration and is our first attempt to frame an approach which allows for analyzing domain knowledge. Our contribution is two-fold: First, we present a solution to pattern-based domain-specific requirements engineering and its exemplary integration into quality assurance techniques.
  arXiv  Detail & Related papers  (2024-04-26T11:38:55Z)
• Assisted Requirements Selection by Clustering [0.0]
  It is a complex multi-criteria decision process that has been focused by many research works because a balance between business profits and investment is needed. This work studies the combination of the qualitative MoSCoW method and cluster analysis for requirements selection.
  arXiv  Detail & Related papers  (2024-01-23T10:33:44Z)
• Regularization-Based Methods for Ordinal Quantification [49.606912965922504]
  We study the ordinal case, i.e., the case in which a total order is defined on the set of n>2 classes. We propose a novel class of regularized OQ algorithms, which outperforms existing algorithms in our experiments.
  arXiv  Detail & Related papers  (2023-10-13T16:04:06Z)
• Improving Software Requirements Prioritization through the Lens of Constraint Solving [0.0]
  This paper presents an interactive method to requirements prioritization that leverages the pairwise comparisons and a constraint solver. We evaluate the proposed method using the requirements from a real healthcare project.
  arXiv  Detail & Related papers  (2023-06-21T17:24:24Z)
• AI Techniques for Software Requirements Prioritization [91.3755431537592]
  The prioritization approaches discussed in this paper are based on different Artificial Intelligence (AI) techniques that can help to improve the overall quality of requirements prioritization processes.
  arXiv  Detail & Related papers  (2021-08-02T12:43:00Z)
• Not All Requirements Prioritization Criteria Are Equal at All Times: A Quantitative Analysis [2.3569088511882335]
  This study investigates which requirements prioritization criteria are most important to use in industry. We extracted 32,139 requirements prioritization decisions based on eight requirements prioritization criteria for 11,110 requirements. The results show that not all requirements prioritization criteria are equally important, and this change depending on how far a requirement has reached in the development process.
  arXiv  Detail & Related papers  (2021-04-13T09:02:47Z)
• Towards Utility-based Prioritization of Requirements in Open Source Environments [51.65930505153647]
  We show how utility-based prioritization approaches can be used to support contributors in conventional and open source Requirements Engineering scenarios. As an example, we show how dependencies can be taken into account in utility-based prioritization processes.
  arXiv  Detail & Related papers  (2021-02-17T09:05:54Z)
• Prior Guided Feature Enrichment Network for Few-Shot Segmentation [64.91560451900125]
  State-of-the-art semantic segmentation methods require sufficient labeled data to achieve good results. Few-shot segmentation is proposed to tackle this problem by learning a model that quickly adapts to new classes with a few labeled support samples. Theses frameworks still face the challenge of generalization ability reduction on unseen classes due to inappropriate use of high-level semantic information.
  arXiv  Detail & Related papers  (2020-08-04T10:41:32Z)
• Extreme Algorithm Selection With Dyadic Feature Representation [78.13985819417974]
  We propose the setting of extreme algorithm selection (XAS) where we consider fixed sets of thousands of candidate algorithms. We assess the applicability of state-of-the-art AS techniques to the XAS setting and propose approaches leveraging a dyadic feature representation.
  arXiv  Detail & Related papers  (2020-01-29T09:40:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.