计算机科学 ›› 2012, Vol. 39 ›› Issue (Z6): 422-424.
• • 上一篇 下一篇
陈阳梅,丁晓明
出版日期:
发布日期:
Online:
Published:
摘要: 测试用例集约简的目的是用尽可能少的测试用例充分测试给定的测试目标。引入聚类分析中K中心点(K-medoids)算法的思想将每一个测试用例作为一个结点并寻找其相似性,将得到的聚类分析结果再根据测试需求从各簇中选择测试用例,从而得到约简的测试用例集。仿真实验的结果证明了该方法的可行性和有效性。
关键词: 测试用例集约简,聚类分析,K中心点算法,错误检测率
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
陈阳梅,丁晓明. 一种基于K中心点算法的测试用例集约简方法[J]. 计算机科学, 2012, 39(Z6): 422-424. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2012/V39/IZ6/422
Cited