田口方法编程示例
我被要求研究一些与“田口方法”相关的编程,特别是与多变量测试相关的编程。这是我尝试研究的第一批主题之一,我发现了零、零、零的代码示例,特别是考虑到它的数学基础。
我找到了一些描述所涉及数学的书籍,但看起来我将进行一些数学复习,除非我能找到一些我可以关联的代码示例。
这是否是一种罕见的东西,一旦你完成了编程,它就变得非常有价值,以至于没有人分享?或者我只是在田口+谷歌失败了?
I've been asked to research some programming related to the "Taguchi Method", especially as it relates to Multi-variant testing. This is one of the first subjects I've tried to research that I've found zero, nada, zilch, code examples for, especially considering its mathematical basis.
I've found some books describing the math involved but it looks like I'm going to be doing some math brush up unless I can find some code examples I can relate to.
Is this one of those rare things that once you work out the programming, it's so valuable that no one shares? Or do I just fail at Taguchi + google?
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(1)
田口设计与覆盖数组是一样的。基本思想是,如果有 F 个数据“字段”,并且每个数据“字段”可以有 N 个不同的值,则可以构造 NF 个不同的测试用例。覆盖数组基本上是一组测试用例,它们一起覆盖两个字段值的所有可能的成对组合,其想法是生成尽可能小的测试用例。例如,如果 F=3 且 N=3,则有 27 个可能的测试用例,但如果您的目标是成对覆盖,则有 9 个测试用例就足够了:
在此表中,您可以选择任意两个字段和任意两个值,并且可以始终找到包含所选字段的所选值的行。
一般来说,生成田口设计是一个困难的组合问题。
您可以通过多种方法生成田口设计:
Taguchi designs are the same thing as covering arrays. The basic idea is that if you have F data "fields" and every one can have N different values, it is possible to construct NF different test cases. A covering array is basically a set of test cases that together cover all possible pairwise combinations of two field values, and the idea is to generate as small one as possible. E.g. if F=3 and N=3, you have 27 possible test cases, but it is enough to have nine test cases if you aim for pairwise coverage:
In this table, you can choose any two fields and any two values and you can always find a row that contains the chosen values for the chosen fields.
Generating Taguchi designs in general is a difficult combinatorial problem.
You can generate Taguchi designs by various methods: