Test Case Prioritization using Clustering Techniques in Software Engineering

dc.contributor.guideSwati V. Chande and N. K. Joshi
dc.coverage.spatial
dc.creator.researcherSHEETAL SHARMA
dc.date.accessioned2026-02-05T11:36:33Z
dc.date.available2026-02-05T11:36:33Z
dc.date.awarded2025
dc.date.completed2025
dc.date.registered2015
dc.description.abstractThe increasing complexity of software systems necessitates thorough testing to ensure newlinetheir reliability and effectiveness [1]. Regression testing is a crucial process that newlineverifies whether recent modifications, such as bug fixes and feature additions, impact newlinethe existing functionality of the software. To enhance the efficiency of regression newlinetesting, various approaches are applied, including K-Means selection, minimization, newlineand prioritization [2]. K-Means Prioritization (TCP) is a widely used technique that newlinearranges K-Means based on factors: number of faults detected, fault severity, newlineexecution time, and code coverage. This approach allows critical faults to be detected newlineearlier, improving testing efficiency and reducing potential risks. newlineThe effectiveness of TCP is often measured using key performance indicators such as newlinethe Average Percentage of Faults Detected (APFD), and execution time. Higher newlineAPFD values indicate faster detection of faults, contributing to a more efficient newlinetesting process. Researchers have explored clustering techniques to improve TCP by newlinegrouping K-Means with similar attributes, which helps in systematically prioritizing newlinethem for execution. newlineClustering techniques play a crucial role in enhancing the APFD rate by newlinesystematically grouping K-Means based on key factors: number of faults detected, newlinefault severity, execution time, and code coverage [19]. Research has demonstrated newlinethat clustering algorithms can effectively form distinct groups of K-Means that newlineexhibit similar characteristics. These structured clusters serve as the basis for newlineprioritization, ensuring that K-Means with a higher likelihood of detecting faults are newlineexecuted earlier in the testing cycle. While clustering-based approaches have shown newlinesignificant improvements in K-Means prioritization, challenges remain, including the newlineneed for more robust frameworks and better handling of K-Means attributes. newlineOvercoming the limitations presents an opportunity for further advancements and newlinerefinements in clustering-driven TCP models [22]. newline
dc.description.note
dc.format.accompanyingmaterialDVD
dc.format.dimensions
dc.format.extent4.11 mb
dc.identifier.researcherid
dc.identifier.urihttp://hdl.handle.net/10603/693164
dc.languageEnglish
dc.publisher.institutionComputer application
dc.publisher.placeKota
dc.publisher.universityRajasthan Technical University, Kota
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Software Engineering
dc.subject.keywordEngineering and Technology
dc.titleTest Case Prioritization using Clustering Techniques in Software Engineering
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 12
Loading...
Thumbnail Image
Name:
80_recommendation.pdf
Size:
193.76 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
abstract.pdf
Size:
496.38 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
annexures.pdf
Size:
298.68 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
chapter - 1.pdf
Size:
270.29 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
chapter - 2.pdf
Size:
518.06 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: