IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0339996.html

GUI test case minimization using sequence mining

Author

Listed:
  • Raheela Ambreen
  • Tamim Ahmed Khan

Abstract

Graphical User Interface (GUI) testing is a crucial aspect of software quality assurance, ensuring that the user-facing components correctly reflect the underlying business logic. Regression testing validates that software continues to function as expected after modifications or integration with other systems. However, executing large test suites repeatedly is time-consuming and resource-intensive. To address this, test case minimization techniques aim to reduce the number of test cases without compromising coverage.In this work, we propose a sequence recording technique for GUI event tracking and test case minimization. The recorded event sequences are clustered using the K-Means algorithm, grouping highly similar events together. A search-based sequence selection is then applied to generate a representative subset of test cases. Our approach was implemented and evaluated using a User Interface (UI) map generated in Visual Studio, where all components were validated and compared with our event map.Experimental results show that our proposed method reduces the total number of test cases by approximately 45%, decreases execution time by 38%, and maintains over 95% coverage compared to the original test suite. These results demonstrate that the proposed approach effectively balances testing efficiency and coverage, providing a practical improvement for GUI regression testing.

Suggested Citation

  • Raheela Ambreen & Tamim Ahmed Khan, 2026. "GUI test case minimization using sequence mining," PLOS ONE, Public Library of Science, vol. 21(2), pages 1-19, February.
  • Handle: RePEc:plo:pone00:0339996
    DOI: 10.1371/journal.pone.0339996
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0339996
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0339996&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0339996?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0339996. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.