Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorKobilinsky, André
dc.contributor.authorMonod, Hervé
dc.contributor.authorBailey, R. A.
dc.date.accessioned2017-06-19T14:30:09Z
dc.date.available2017-06-19T14:30:09Z
dc.date.issued2017-09
dc.identifier.citationKobilinsky , A , Monod , H & Bailey , R A 2017 , ' Automatic generation of generalised regular factorial designs ' , Computational Statistics and Data Analysis , vol. 113 , pp. 311-329 . https://doi.org/10.1016/j.csda.2016.09.003en
dc.identifier.issn0167-9473
dc.identifier.otherPURE: 245970146
dc.identifier.otherPURE UUID: baeb5bc6-62c8-4af6-a215-a963d1d583f0
dc.identifier.otherRIS: urn:C1273A33787D9C4F45AD8D0CE3E5A8C9
dc.identifier.otherScopus: 85008616133
dc.identifier.otherORCID: /0000-0002-8990-2099/work/39600104
dc.identifier.otherWOS: 000404822600025
dc.identifier.urihttp://hdl.handle.net/10023/11025
dc.descriptionOpen Access for this article was paid for by the French Research Agency (ANR), project Escapade (ANR-12-AGRO-0003).en
dc.description.abstractThe R package planor enables the user to search for, and construct, factorial designs satisfying given conditions. The user specifies the factors and their numbers of levels, the factorial terms which are assumed to be non-zero, and the subset of those which are to be estimated. Both block and treatment factors can be allowed for, and they may have either fixed or random effects, as well as hierarchy relationships. The designs are generalised regular designs, which means that each one is constructed by using a design key and that the underlying theory is that of finite abelian groups. The main theoretical results and algorithms on which planor is based are developed and illustrated, with the emphasis on mathematical rather than programming details. Sections 3–5 are dedicated to the elementary case, when the numbers of levels of all factors are powers of the same prime. The ineligible factorial terms associated with users’ specifications are defined and it is shown how they can be used to search for a design key by a backtrack algorithm. Then the results are extended to the case when different primes are involved, by making use of the Sylow decomposition of finite abelian groups. The proposed approach provides a unified framework for a wide range of factorial designs.
dc.format.extent19
dc.language.isoeng
dc.relation.ispartofComputational Statistics and Data Analysisen
dc.rights© 2016 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).en
dc.subjectBacktrack algorithmen
dc.subjectDesign keyen
dc.subjectHierarchy constrainten
dc.subjectIneligible factorial termen
dc.subjectModel specificationen
dc.subjectMulti-stratum designen
dc.subjectQA Mathematicsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject3rd-DASen
dc.subjectBDCen
dc.subject.lccQAen
dc.subject.lccQA75en
dc.titleAutomatic generation of generalised regular factorial designsen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews.Statisticsen
dc.contributor.institutionUniversity of St Andrews.Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1016/j.csda.2016.09.003
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record