Computer Science ›› 2012, Vol. 39 ›› Issue (Z6): 422-424.
Previous Articles Next Articles
Online:
Published:
Abstract: According to the given testing objectives, test suite reduction aims to satisfy all testing requirements with the minimum number of test cases. This paper introduced the idea of K-medoids algorithm of cluster analysis to finish the test suite reduction. First, treat every test case as a node and find its similarity. And then, according to testing require-ments,choose test cases from test case suite. The results of the emulate programs prove that the method is effective and feasible.
Key words: Test suite reduction,Cluster analysis,K-medoids,Fault detection effectiveness
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2012/V39/IZ6/422
Cited