Title of article
Minimum Spanning Tree: A new approach to assess the quality of the design of computer experiments
Author/Authors
Franco، نويسنده , , J. O. Vasseur، نويسنده , , O. Le Corre، نويسنده , , B. and Sergent، نويسنده , , M.، نويسنده ,
Issue Information
دوفصلنامه با شماره پیاپی سال 2009
Pages
6
From page
164
To page
169
Abstract
In the computer experiment setting, if the relationship between the response and inputs is unknown, then the purpose is to use designs that spread the points at which we observe the response evenly throughout the region. These designs are called Space-Filling Designs. Different measures or metrics quantify how a set of points is spread out. In this paper, we present two types of measures of uniformity: discrepancy and point-to-point measures which take into account the distances between the pairs of points. However these criteria of quantification do not permit the qualification of the distribution. Thus, we discuss a new approach to assess the quality of computer experiments. This approach is based on a graph constructed from the set of points of the experimental design. This graph, called Minimum Spanning Tree, allows us to deduce two parameters—the mean and the standard deviation of the edges length—which characterize the points distribution to be studied.
Keywords
Computer experiments , Measures of uniformity , Space-Filling Designs , Minimum spanning tree
Journal title
Chemometrics and Intelligent Laboratory Systems
Serial Year
2009
Journal title
Chemometrics and Intelligent Laboratory Systems
Record number
1489519
Link To Document