IDEAS home Printed from https://ideas.repec.org/a/bla/jorssc/v45y1996i3p311-322.html
   My bibliography  Save this article

A Comparative Analysis of the Performance of Taguchi's Linear Graphs for the Design of Two‐Level Fractional Factorials

Author

Listed:
  • Søren Bisgaard

Abstract

In this paper conventional concepts of aliases and confounding are used to analyse several two‐level fractional factorial designs constructed with the use of Taguchi's linear graph technique. Taguchi's designs are subsequently compared with more conventional alternatives and it is shown that the latter often are better in terms of resolution and are more robust to assumptions that are likely to be violated in practice. We also comment on the practice of making prior assumptions based on engineering knowledge about which two‐factor interactions are active. We conclude that, although the linear graph method has other applications, the need for this method for the design of two‐level fractional factorials is limited, that the designs obtained are non‐robust and that better and simpler conventional alternatives exist.

Suggested Citation

  • Søren Bisgaard, 1996. "A Comparative Analysis of the Performance of Taguchi's Linear Graphs for the Design of Two‐Level Fractional Factorials," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 45(3), pages 311-322, September.
    • Handle: RePEc:bla:jorssc:v:45:y:1996:i:3:p:311-322
    DOI: 10.2307/2986090
    as

    Download full text from publisher

    File URL: https://doi.org/10.2307/2986090
    Download Restriction: no
    File URL: https://libkey.io/10.2307/2986090?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Charles J. Colbourn & Daniel W. McClary, 2008. "Locating and detecting arrays for interaction faults," Journal of Combinatorial Optimization, Springer, vol. 15(1), pages 17-48, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jorssc:v:45:y:1996:i:3:p:311-322. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/rssssea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.