Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
MBRP: Model-Based Requirements Prioritization Using PageRank Algorithm
RISE - Research Institutes of Sweden, ICT, SICS.
National University of Computer and Emerging Sciences, Pakistan.
National University of Computer and Emerging Sciences, Pakistan.
RISE - Research Institutes of Sweden, ICT, SICS.ORCID-id: 0000-0002-1512-0844
Visa övriga samt affilieringar
2019 (Engelska)Ingår i: 2019 26th Asia-Pacific Software Engineering Conference (APSEC), 2019, s. 31-38Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
2019. s. 31-38
Nyckelord [en]
requirement prioritization, requirements interdependencies, meta model, page-rank
Nationell ämneskategori
Naturvetenskap
Identifikatorer
URN: urn:nbn:se:ri:diva-42585DOI: 10.1109/APSEC48747.2019.00014OAI: oai:DiVA.org:ri-42585DiVA, id: diva2:1384755
Konferens
2019 26th Asia-Pacific Software Engineering Conference (APSEC)
Tillgänglig från: 2020-01-10 Skapad: 2020-01-10 Senast uppdaterad: 2020-01-23Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Saadatmand, Mehrdad

Sök vidare i DiVA

Av författaren/redaktören
Saadatmand, Mehrdad
Av organisationen
SICS
Naturvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 11 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.10