Skip to main content

Design Algorithms for Correlated Data

  • Conference paper
COMPSTAT

Abstract

The design of experiments when the data are correlated is an area of increasing research interest, particularly since methods for the analysis of experiments which incorporate a correlation structure for errors or over the plots are becoming more generally applied. In this paper the design of experiments of a two-dimensional layout (rows and columns) with a spatial process is investigated. Algorithms based on simulated annealing and Tabu search are developed for constructing optimal designs. The robustness of designs with respect to correlation structure is examined. A number of examples are considered including a practical example of an early generation variety trial example is given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aarts, E.H.L. & van Laarhoven, P.J.M. (1989). Simulated annealing: an introduction. Statistica Neerlandica, 43, 31–52.

    Article  MathSciNet  MATH  Google Scholar 

  • Cullis, B.R. & Gleeson, A.C. (1991). Spatial analysis of field experiments — an extension to two dimensions. Biometrics, 47, 1449–1460.

    Article  Google Scholar 

  • Gilmour, A.R., Cullis, B.R. & Verbyla, A.P. (1997). Accounting for natural and extraneous variation in the analysis of field experiments. Journal of Agricultural, Biological, and Environmental Statistics, 2, 269–293.

    Article  MathSciNet  Google Scholar 

  • Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1, 190–206.

    Article  MathSciNet  MATH  Google Scholar 

  • Glover, F. (1990). Tabu search — Part II. ORSA Journal on Computing, 2, 4–32.

    Article  MATH  Google Scholar 

  • Jones, B. & Eccleston, J. (1980). Exchange and interchange procedures to search for optimal designs. Journal of the Royal Statistical Society Series B, 42, 238–243.

    MathSciNet  MATH  Google Scholar 

  • Martin, R.J. & Eccleston, J.A. (1997). Construction of optimal and near optimal designs for dependent observations using simulated annealing, The Australian Journal of Statistics, accepted (under revision), Research Report, University of Sheffield, Department of probability and statistics.

    Google Scholar 

  • Martin, R.J., Eccleston, J.A. & Jones, G. (1998). Some results on multi-level factorial designs with dependent observations. Journal of Statistical Planning and Inference, in pressg

    Google Scholar 

  • Russell, K.G. & Eccleston, J.A. (1987a). The construction of optimal balanced incomplete block designs when adjacent observations are correlated. The Australian Journal of Statistics, 29, 84–90.

    Article  MathSciNet  MATH  Google Scholar 

  • Russell, K.G. & Eccleston, J.A. (1987b). The construction of optimal incomplete block designs when observations within a block are correlated. The Australian Journal of Statistics, 29, 293–302.

    Article  MathSciNet  Google Scholar 

  • Williams, E.R. (1986). A neighbour model for field experiments, Biometrika, 73, 279–287.

    Article  MathSciNet  Google Scholar 

  • Zergaw, G. (1989). A sequential method of constructing optimal block designs. The Australian Journal of Statistics, 31, 333–342.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eccleston, J., Chan, B. (1998). Design Algorithms for Correlated Data. In: Payne, R., Green, P. (eds) COMPSTAT. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-01131-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-01131-7_4

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1131-5

  • Online ISBN: 978-3-662-01131-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics