Assisted Requirements Selection by Clustering
- URL: http://arxiv.org/abs/2401.12634v1
- Date: Tue, 23 Jan 2024 10:33:44 GMT
- Title: Assisted Requirements Selection by Clustering
- Authors: Jos\'e del Sagrado, Isabel M del \'Aguila
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Requirements selection is a decision-making process that enables project
managers to focus on the deliverables that add most value to the project
outcome. This task is performed to define which features or requirements will
be developed in the next release. 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. The spectrum of prioritization
techniques spans from simple and qualitative to elaborated analytic
prioritization approaches that fall into the category of optimization
algorithms. This work studies the combination of the qualitative MoSCoW method
and cluster analysis for requirements selection. The feasibility of our
methodology has been tested on three case studies (with 20, 50 and 100
requirements). In each of them, the requirements have been clustered, then the
clustering configurations found have been evaluated using internal validation
measures for the compactness, connectivity and separability of the clusters.
The experimental results show the validity of clustering strategies for the
identification of the core set of requirements for the software product, being
the number of categories proposed by MoSCoW a good starting point in
requirements prioritization and negotiation.
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) - A3S: A General Active Clustering Method with Pairwise Constraints [66.74627463101837]
A3S features strategic active clustering adjustment on the initial cluster result, which is obtained by an adaptive clustering algorithm.
In extensive experiments across diverse real-world datasets, A3S achieves desired results with significantly fewer human queries.
arXiv Detail & Related papers (2024-07-14T13:37:03Z) - Choosing a Suitable Requirement Prioritization Method: A Survey [1.4155748588033552]
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.
arXiv Detail & Related papers (2024-02-20T17:05:16Z) - A Weighted K-Center Algorithm for Data Subset Selection [70.49696246526199]
Subset selection is a fundamental problem that can play a key role in identifying smaller portions of the training data.
We develop a novel factor 3-approximation algorithm to compute subsets based on the weighted sum of both k-center and uncertainty sampling objective functions.
arXiv Detail & Related papers (2023-12-17T04:41:07Z) - 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) - Gradient Based Clustering [72.15857783681658]
We propose a general approach for distance based clustering, using the gradient of the cost function that measures clustering quality.
The approach is an iterative two step procedure (alternating between cluster assignment and cluster center updates) and is applicable to a wide range of functions.
arXiv Detail & Related papers (2022-02-01T19:31:15Z) - Exploring Neural Models for Query-Focused Summarization [74.41256438059256]
We conduct a systematic exploration of neural approaches to query-focused summarization (QFS)
We present two model extensions that achieve state-of-the-art performance on the QMSum dataset by a margin of up to 3.38 ROUGE-1, 3.72 ROUGE-2, and 3.28 ROUGE-L.
arXiv Detail & Related papers (2021-12-14T18:33:29Z) - A review of systematic selection of clustering algorithms and their
evaluation [0.0]
This paper aims to identify a systematic selection logic for clustering algorithms and corresponding validation concepts.
The goal is to enable potential users to choose an algorithm that fits best to their needs and the properties of their underlying data clustering problem.
arXiv Detail & Related papers (2021-06-24T07:01:46Z) - HAWKS: Evolving Challenging Benchmark Sets for Cluster Analysis [2.5329716878122404]
Comprehensive benchmarking of clustering algorithms is difficult.
There is no consensus regarding the best practice for rigorous benchmarking.
We demonstrate the important role evolutionary algorithms play to support flexible generation of such benchmarks.
arXiv Detail & Related papers (2021-02-13T15:01:34Z) - Causal Feature Selection for Algorithmic Fairness [61.767399505764736]
We consider fairness in the integration component of data management.
We propose an approach to identify a sub-collection of features that ensure the fairness of the dataset.
arXiv Detail & Related papers (2020-06-10T20:20:10Z)
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.