Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
MBRP: Model-based Requirements Prioritization Using PageRank Algorithm
RISE Research Institutes of Sweden, Digital Systems, Industrial Systems. (Smart Industrial Automation)ORCID iD: 0000-0001-6418-9971
National University of Computer& Emerging Sciences, Pakistan.
National University of Computer& Emerging Sciences, Pakistan.
RISE Research Institutes of Sweden.ORCID iD: 0000-0002-1512-0844
Show others and affiliations
2019 (English)In: The 26th Asia-Pacific Software Engineering Conference, IEEE conference proceedings, 2019Conference paper, Published paper (Refereed)
Abstract [en]

Requirements prioritization plays an important role in driving project success during software development. Literature reveals that existing requirements prioritization approaches ignore vital factors such as interdependency between requirements. Existing requirements prioritization approaches are also generally time-consuming and involve substantial manual effort. Besides, these approaches show substantial limitations in terms of the number of requirements under consideration. There is some evidence suggesting that models could have a useful role in the analysis of requirements interdependency and their visualization, contributing towards the improvement of the overall requirements prioritization process. However, to date, just a handful of studies are focused on model-based strategies for requirements prioritization, considering only conflict-free functional requirements. This paper uses a meta-model-based approach to help the requirements analyst to model the requirements, stakeholders, and inter-dependencies between requirements. The model instance is then processed by our modified PageRank algorithm to prioritize the given requirements. An experiment was conducted, comparing our modified PageRank algorithm’s efficiency and accuracy with five existing requirements prioritization methods. Besides, we also compared our results with a baseline prioritized list of 104 requirements prepared by 28 graduate students. Our results show that our modified PageRank algorithm was able to prioritize the requirements more effectively and efficiently than the other prioritization methods.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2019.
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:ri:diva-67428DOI: 10.1109/APSEC48747.2019.00014OAI: oai:DiVA.org:ri-67428DiVA, id: diva2:1800987
Conference
The 26th Asia-Pacific Software Engineering Conference
Available from: 2023-09-28 Created: 2023-09-28 Last updated: 2023-10-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textFull text

Authority records

Abbas, MuhammadSaadatmand, Mehrdad

Search in DiVA

By author/editor
Abbas, MuhammadSaadatmand, Mehrdad
By organisation
Industrial SystemsRISE Research Institutes of Sweden
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 738 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf