SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Bohlin Pernilla 1976)
 

Search: WFRF:(Bohlin Pernilla 1976) > Requirement or Not,...

  • Bashir, SarmadMälardalens universitet,RISE,Industriella system,Mälardalen University, Sweden,Innovation och produktrealisering,RISE Research Institutes of Sweden, Västerås, Sweden (author)

Requirement or Not, That is the Question : A Case from the Railway Industry

  • Article/chapterEnglish2023

Publisher, publication year, extent ...

  • Springer Science and Business Media Deutschland GmbH,2023
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:ri-64397
  • https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-64397URI
  • https://doi.org/10.1007/978-3-031-29786-1_8DOI
  • https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-62331URI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:kon swepub-publicationtype

Notes

  • Correspondence Address: Abbas, M. RISE Research Institutes of Sweden, Sweden; email: muhammad.abbas@ri.se; Funding details: ITEA; Funding text 1: Acknowledgement. This work is partially funded by the AIDOaRt (KDT) and SmartDelta [27] (ITEA) projects.
  • Requirements in tender documents are often mixed with other supporting information. Identifying requirements in large tender documents could aid the bidding process and help estimate the risk associated with the project.  Manual identification of requirements in large documents is a resource-intensive activity that is prone to human error and limits scalability. This study compares various state-of-the-art approaches for requirements identification in an industrial context. For generalizability, we also present an evaluation on a real-world public dataset. We formulate the requirement identification problem as a binary text classification problem. Various state-of-the-art classifiers based on traditional machine learning, deep learning, and few-shot learning are evaluated for requirements identification based on accuracy, precision, recall, and F1 score. Results from the evaluation show that the transformer-based BERT classifier performs the best, with an average F1 score of 0.82 and 0.87 on industrial and public datasets, respectively. Our results also confirm that few-shot classifiers can achieve comparable results with an average F1 score of 0.76 on significantly lower samples, i.e., only 20% of the data.  There is little empirical evidence on the use of large language models and few-shots classifiers for requirements identification. This paper fills this gap by presenting an industrial empirical evaluation of the state-of-the-art approaches for requirements identification in large tender documents. We also provide a running tool and a replication package for further experimentation to support future research in this area. © 2023, The Author(s)

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Abbas, MuhammadMälardalens universitet,RISE,Industriella system,Mälardalen University, Sweden,Inbyggda system,RISE Research Institutes of Sweden, Västerås, Sweden(Swepub:mdh)mas03 (author)
  • Saadatmand, Mehrdad,1980-Mälardalens universitet,RISE,Industriella system,Inbyggda system(Swepub:mdh)msd03 (author)
  • Enoiu, Eduard Paul,PhDMälardalens universitet,Inbyggda system(Swepub:mdh)epu01 (author)
  • Bohlin, Markus,1976-Mälardalens universitet,Innovation och produktrealisering(Swepub:mdh)mbn05 (author)
  • Lindberg, PernillaAlstom, Västerås, Sweden (author)
  • RISEIndustriella system (creator_code:org_t)

Related titles

  • In:<em>Lecture Notes in Computer Science. </em>Volume 13975. Pages 105 - 121 2023: Springer Science and Business Media Deutschland GmbH, s. 105-1219783031297854

Internet link

Find in a library

To the university's database

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view