Premium
Selecting the Best Wild Card Entries in a Covering Array
Author(s) -
Kim Youngil,
Jang DaeHeung,
AndersonCook Christine M.
Publication year - 2017
Publication title -
quality and reliability engineering international
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 62
eISSN - 1099-1638
pISSN - 0748-8017
DOI - 10.1002/qre.2129
Subject(s) - orthogonality , flexibility (engineering) , computer science , data mining , mathematics , statistics , geometry
For some covering arrays, there are some wild card positions in the array where there is flexibility about what factor levels can be chosen with no impact on the basic properties of covering array, because all of the required pairs have been covered. The choice of how to fill these wild card positions can influence other properties, such as the degrees of orthogonality or three‐way coverage of the array. In this paper, some criteria are proposed for identifying the best choices for the wild card positions to create covering arrays with highly desirable properties. Accompanying graphical summaries are also described to highlight differing performance for several examples. Copyright © 2017 John Wiley & Sons, Ltd.