.png){kind=icon}
.png){kind=icon}
Return
Stratification pattern enumerator and its applications
.png){kind=icon}
PRE
AI
DOI：10.1093/jrsssb/qkad125.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Space-filling designs are widely used in computer experiments. A minimum aberration-type space-filling criterion was recently proposed to rank and assess a family of space-filling designs including orthogonal array-based Latin hypercubes and strong orthogonal arrays. However, it is difficult to apply the criterion in practice because it requires intensive computation for determining the space-filling pattern, which measures the stratification properties of designs on various subregions. In this article, we propose a stratification pattern enumerator to characterise the stratification properties. The enumerator is easy to compute and can efficiently rank space-filling designs. We show that the stratification pattern enumerator is a linear combination of the space-filling pattern. Based on the connection, we develop efficient algorithms for calculating the space-filling pattern. In addition, we establish a lower bound for the stratification pattern enumerator and present construction methods for designs that achieve the lower bound using multiplication tables over Galois fields. The constructed designs have good space-filling properties in low-dimensional projections and are robust under various criteria.
Keywords:
computer experiment
generalised minimum aberration
NRT-distance
space-filling design
space-filling hierarchy principle
strong orthogonal array
Journal
J
IF:
3.6
Papers:
1.5K
Citations:
3.2W
