MétaCan
Menu
Back to cohort
Record W2783864264 · doi:10.5539/mas.v12n2p54

Grey Wolf Algorithm for Requirements Prioritization

2018· article· en· W2783864264 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueModern Applied Science · 2018
Typearticle
Languageen
FieldComputer Science
TopicSoftware Engineering Research
Canadian institutionsnot available
Fundersnot available
KeywordsPrioritizationViewpointsAnalytic hierarchy processComputer scienceRequirement prioritizationsortHierarchySoftwareProcess (computing)Order (exchange)SortingOperations researchRequirements engineeringData miningAlgorithmMathematicsManagement scienceRequirements managementDatabaseEngineering

Abstract

fetched live from OpenAlex

Requirement prioritization is one of the most important approach in the process of requirement engineering due to use it in order to prioritize the execution sort of requirements with taking into account the viewpoints of stakeholders. Thus, in this study, grey wolf optimization (GWO) algorithm is applied in order to prioritize the requirements of a software project. GWO imitates the hunting behavior of grey wolves in nature. Which distinct from others that it has dominant leadership hierarchy which contains four main types; alpha, beta delta and omega wolves. In this paper, a proposed algorithm is presented to prioritize the requirements into ordered list. Furthermore, it is compared and evaluated with analytical hierarchy process (AHP) technique in terms of average running time and dataset size. The findings display that the RP-GWO performs better than AHP mechanism by approximately (30%).

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.945
Threshold uncertainty score0.464

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.031
GPT teacher head0.301
Teacher spread0.271 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it