IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i9p1272-d1380906.html
   My bibliography  Save this article

Requirement Dependency Extraction Based on Improved Stacking Ensemble Machine Learning

Author

Listed:
  • Hui Guan

    (Department of Computer Science and Technology, Shenyang University of Chemical Technology, Shenyang 110142, China
    Key Laboratory of Industrial Intelligence Technology on Chemical Process, Shenyang University of Chemical Technology, Shenyang 110142, China)

  • Hang Xu

    (Department of Computer Science and Technology, Shenyang University of Chemical Technology, Shenyang 110142, China)

  • Lie Cai

    (Department of Computer Science and Technology, Shenyang University of Chemical Technology, Shenyang 110142, China)

Abstract

To address the cost and efficiency issues of manually analysing requirement dependency in requirements engineering, a requirement dependency extraction method based on part-of-speech features and an improved stacking ensemble learning model (P-Stacking) is proposed. Firstly, to overcome the problem of singularity in the feature extraction process, this paper integrates part-of-speech features, TF-IDF features, and Word2Vec features during the feature selection stage. The particle swarm optimization algorithm is used to allocate weights to part-of-speech tags, which enhances the significance of crucial information in requirement texts. Secondly, to overcome the performance limitations of standalone machine learning models, an improved stacking model is proposed. The Low Correlation Algorithm and Grid Search Algorithms are utilized in P-stacking to automatically select the optimal combination of the base models, which reduces manual intervention and improves prediction performance. The experimental results show that compared with the method based on TF-IDF features, the highest F1 scores of a standalone machine learning model in the three datasets were improved by 3.89%, 10.68%, and 21.4%, respectively, after integrating part-of-speech features and Word2Vec features. Compared with the method based on a standalone machine learning model, the improved stacking ensemble machine learning model improved F1 scores by 2.29%, 5.18%, and 7.47% in the testing and evaluation of three datasets, respectively.

Suggested Citation

  • Hui Guan & Hang Xu & Lie Cai, 2024. "Requirement Dependency Extraction Based on Improved Stacking Ensemble Machine Learning," Mathematics, MDPI, vol. 12(9), pages 1-37, April.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:9:p:1272-:d:1380906
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/9/1272/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/9/1272/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:9:p:1272-:d:1380906. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.