Separating interaction effects using locating and detecting arrays

Stephen A. Seidel, Kaushik Sarkar, Charles Colbourn, Violet Syrotiuk

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The correctness and performance of complex engineered systems are often impacted by many factors, each of which has many possible levels. Performance can be affected not just by individual factor-level choices, but also by interactions among them. While covering arrays have been employed to produce combinatorial test suites in which every possible interaction of a specified number of factor levels arises in at least one test, in general they do not identify the specific interaction(s) that are significant. Locating and detecting arrays strengthen the requirements to permit the identification of a specified number of interactions of a specified size. Further, to cope with outliers or missing responses in data collected from real engineered systems, a further requirement of separation is introduced. In this paper, we examine two randomized methods for the construction of locating and detecting arrays, the first based on the Stein-Lovász-Johnson paradigm, and the second based on the Lovász Local Lemma. Each can be derandomized to yield efficient algorithms for construction, the first using a conditional expectation method, and the second using Moser-Tardos resampling. We apply these methods to produce upper bounds on sizes of locating and detecting arrays for various numbers of factors and levels, when one interaction of two factor levels is to be detected or located, for separation of up to four. We further compare the sizes obtained with those from more targeted (and more computationally intensive) heuristic methods.

Original languageEnglish (US)
Title of host publicationCombinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings
EditorsHon Wai Leong, Costas Iliopoulos, Wing-Kin Sung
PublisherSpringer Verlag
Pages349-360
Number of pages12
ISBN (Print)9783319946665
DOIs
StatePublished - Jan 1 2018
Event29th International Workshop on Combinatorial Algorithms, IWOCA 2018 - Singapore, Singapore
Duration: Jul 16 2018Jul 19 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10979 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other29th International Workshop on Combinatorial Algorithms, IWOCA 2018
CountrySingapore
CitySingapore
Period7/16/187/19/18

Fingerprint

Interaction Effects
Heuristic methods
Interaction
Large scale systems
Covering Array
Requirements
Conditional Expectation
Heuristic Method
Resampling
Outlier
Lemma
Complex Systems
Correctness
Efficient Algorithms
Paradigm
Upper bound

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Seidel, S. A., Sarkar, K., Colbourn, C., & Syrotiuk, V. (2018). Separating interaction effects using locating and detecting arrays. In H. W. Leong, C. Iliopoulos, & W-K. Sung (Eds.), Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings (pp. 349-360). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10979 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-94667-2_29

Separating interaction effects using locating and detecting arrays. / Seidel, Stephen A.; Sarkar, Kaushik; Colbourn, Charles; Syrotiuk, Violet.

Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings. ed. / Hon Wai Leong; Costas Iliopoulos; Wing-Kin Sung. Springer Verlag, 2018. p. 349-360 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10979 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Seidel, SA, Sarkar, K, Colbourn, C & Syrotiuk, V 2018, Separating interaction effects using locating and detecting arrays. in HW Leong, C Iliopoulos & W-K Sung (eds), Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10979 LNCS, Springer Verlag, pp. 349-360, 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, Singapore, Singapore, 7/16/18. https://doi.org/10.1007/978-3-319-94667-2_29
Seidel SA, Sarkar K, Colbourn C, Syrotiuk V. Separating interaction effects using locating and detecting arrays. In Leong HW, Iliopoulos C, Sung W-K, editors, Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings. Springer Verlag. 2018. p. 349-360. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-94667-2_29
Seidel, Stephen A. ; Sarkar, Kaushik ; Colbourn, Charles ; Syrotiuk, Violet. / Separating interaction effects using locating and detecting arrays. Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings. editor / Hon Wai Leong ; Costas Iliopoulos ; Wing-Kin Sung. Springer Verlag, 2018. pp. 349-360 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fea515f9dc0340cd8c0add9d5663bd57,
title = "Separating interaction effects using locating and detecting arrays",
abstract = "The correctness and performance of complex engineered systems are often impacted by many factors, each of which has many possible levels. Performance can be affected not just by individual factor-level choices, but also by interactions among them. While covering arrays have been employed to produce combinatorial test suites in which every possible interaction of a specified number of factor levels arises in at least one test, in general they do not identify the specific interaction(s) that are significant. Locating and detecting arrays strengthen the requirements to permit the identification of a specified number of interactions of a specified size. Further, to cope with outliers or missing responses in data collected from real engineered systems, a further requirement of separation is introduced. In this paper, we examine two randomized methods for the construction of locating and detecting arrays, the first based on the Stein-Lov{\'a}sz-Johnson paradigm, and the second based on the Lov{\'a}sz Local Lemma. Each can be derandomized to yield efficient algorithms for construction, the first using a conditional expectation method, and the second using Moser-Tardos resampling. We apply these methods to produce upper bounds on sizes of locating and detecting arrays for various numbers of factors and levels, when one interaction of two factor levels is to be detected or located, for separation of up to four. We further compare the sizes obtained with those from more targeted (and more computationally intensive) heuristic methods.",
author = "Seidel, {Stephen A.} and Kaushik Sarkar and Charles Colbourn and Violet Syrotiuk",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-94667-2_29",
language = "English (US)",
isbn = "9783319946665",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "349--360",
editor = "Leong, {Hon Wai} and Costas Iliopoulos and Wing-Kin Sung",
booktitle = "Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings",

}

TY - GEN

T1 - Separating interaction effects using locating and detecting arrays

AU - Seidel, Stephen A.

AU - Sarkar, Kaushik

AU - Colbourn, Charles

AU - Syrotiuk, Violet

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The correctness and performance of complex engineered systems are often impacted by many factors, each of which has many possible levels. Performance can be affected not just by individual factor-level choices, but also by interactions among them. While covering arrays have been employed to produce combinatorial test suites in which every possible interaction of a specified number of factor levels arises in at least one test, in general they do not identify the specific interaction(s) that are significant. Locating and detecting arrays strengthen the requirements to permit the identification of a specified number of interactions of a specified size. Further, to cope with outliers or missing responses in data collected from real engineered systems, a further requirement of separation is introduced. In this paper, we examine two randomized methods for the construction of locating and detecting arrays, the first based on the Stein-Lovász-Johnson paradigm, and the second based on the Lovász Local Lemma. Each can be derandomized to yield efficient algorithms for construction, the first using a conditional expectation method, and the second using Moser-Tardos resampling. We apply these methods to produce upper bounds on sizes of locating and detecting arrays for various numbers of factors and levels, when one interaction of two factor levels is to be detected or located, for separation of up to four. We further compare the sizes obtained with those from more targeted (and more computationally intensive) heuristic methods.

AB - The correctness and performance of complex engineered systems are often impacted by many factors, each of which has many possible levels. Performance can be affected not just by individual factor-level choices, but also by interactions among them. While covering arrays have been employed to produce combinatorial test suites in which every possible interaction of a specified number of factor levels arises in at least one test, in general they do not identify the specific interaction(s) that are significant. Locating and detecting arrays strengthen the requirements to permit the identification of a specified number of interactions of a specified size. Further, to cope with outliers or missing responses in data collected from real engineered systems, a further requirement of separation is introduced. In this paper, we examine two randomized methods for the construction of locating and detecting arrays, the first based on the Stein-Lovász-Johnson paradigm, and the second based on the Lovász Local Lemma. Each can be derandomized to yield efficient algorithms for construction, the first using a conditional expectation method, and the second using Moser-Tardos resampling. We apply these methods to produce upper bounds on sizes of locating and detecting arrays for various numbers of factors and levels, when one interaction of two factor levels is to be detected or located, for separation of up to four. We further compare the sizes obtained with those from more targeted (and more computationally intensive) heuristic methods.

UR - http://www.scopus.com/inward/record.url?scp=85049926284&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85049926284&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-94667-2_29

DO - 10.1007/978-3-319-94667-2_29

M3 - Conference contribution

SN - 9783319946665

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 349

EP - 360

BT - Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings

A2 - Leong, Hon Wai

A2 - Iliopoulos, Costas

A2 - Sung, Wing-Kin

PB - Springer Verlag

ER -