Minimum Spanning Tree: A new approach to assess the quality of the design of computer experiments

Chemometrics and Intelligent Laboratory Systems

Volumn 97, Issue 2, 2009, Pages 164-169

  Franco, J ^a,b   Vasseur, O ^c   Corre, B ^a   Sergent, M ^d  

^a CSTJF   (France)

^b ECOLE DES MINES DE SAINT ETIENNE   (France)

^c Office National d'Etudes et de Recherches Aerospatiales   (France)

^d AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Computer experiments; Measures of uniformity; Minimum Spanning Tree; Space Filling Designs

Indexed keywords

ARTICLE; COMPUTER; COMPUTER ANALYSIS; EXPERIMENTAL DESIGN; MINIMUM SPANNING TREE; PARAMETER; PRIORITY JOURNAL; STATISTICAL ANALYSIS;

EID: 67349256708     PISSN: 01697439     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.chemolab.2009.03.011     Document Type: Article

References (18)

1. Chen V.C.P., Tsui K.L., Barton R.R., and Allen J.K. A review of design and modeling in computer experiments. Handb. Stat. 22 (2003) 231-261
2. Dussert C., Rasigni G., Rasigni M., and Palmari J. Minimal spanning tree: a new approach for studying order and disorder. Phys. Rev., B 34 5 (1986) 3528-3531
3. Fisher R.A. The arrangement of field experiments. J. Minist. Agric. 33 (1926) 503-513
4. Gunzburger M., and Burkardt J. Uniformity measures for point samples in hypercubes. www.csit.fsu.edu/~burkardt/pdf/ptmeas.pdf
5. Halton J.H. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math. 2 (1960) 84-90
6. Hammersley J.M., Halton J.H., and Bearwood J. The shortest path through many points. Camb. Philos. Soc. Proc. 55 (1959) 299-327
7. Hickernell F.J. A generalized discrepancy and quadrature error bound. Math. Comp. 67 (1998) 299-322
8. Johnson M.E., Moore L.M., and Ylvisaker D. Minimax and maximin distance designs. J. Statist. Plann. Inference 26 (1990) 131-148
9. Knuth D.E. The Art of Computer Programming vol. 2 (1969), Addison-Wesley, New-York
10. Kruskal J.B. On the shortest spanning subtree of a graph and travelling salesman problem. Proc. Am. Math. Soc. 7 (1956) 48-50
11. Mc Kay M.D., Beckman R.J., and Conover W.J. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21 (1979) 239-245
12. Neyman J., and Scott E.L. Statistical approach to problems of cosmology. J.R. Stat. Soc. B 20 (1958) 1-43
13. Niederreiter H. Point sets and sequences with small discrepancy. Monasth. Math. 104 (1987) 273-337
14. Prim R.C. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 (1957) 1389-1401
15. M. Sergent, Contribution de la Méthodologie de la Recherche Expérimentale à l'élaboration de matrices uniformes: Application aux effets de solvants et de substituants, Ph D Thesis, 1989, Université Aix Marseille III.
16. Sergent M., Phan-Tan-Luu R., and Elguero J. Statistical analysis of solvent scales. Part 1. An. Quim. Int. Ed. 93 (1997) 3-6
17. Wallet F., and Dussert C. Comparison of spatial point patterns and processes characterization methods. Europhys. Lett. 42 (1998) 493-498
18. Zhan C. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comput. C-20 1 (1971)