Corpus ID: 15543658

Balancing Context Effects by Controlled Experiments in Within-Subject Design Optimizing Condition Counterbalancing

@inproceedings{Zeeuw2010BalancingCE,
  title={Balancing Context Effects by Controlled Experiments in Within-Subject Design Optimizing Condition Counterbalancing},
  author={T. D. Zeeuw},
  year={2010}
}
To minimize the effects that occur because of condition ordering in within-subject designs, we propose a formula based on the work of Barbieri and Stinstra [1]. We implement this formula and create a program to solve the problem of creating individual orderings for each participant of a withinsubject experiment with all orderings together being balanced. This program uses a heuristic approach to bridge some of the problems that come up due to the (almost) exponential increase in the… Expand

Tables from this paper

References

SHOWING 1-8 OF 8 REFERENCES
Within-subjects designs: To use or not to use?
This article considers the several factors pertinent to deciding whether a withinor between-subjects design should be employed for a research application. A general principle favoring within-subjectsExpand
Complete Counterbalancing of Immediate Sequential Effects in a Latin Square Design
Abstract If there is an even number of experimental conditions (Latin letters), it is possible to construct a Latin Square in which each condition is preceded by a different condition in every rowExpand
Experimental design
  • J. Morgan, X. Deng
  • Computer Science
  • Wiley Interdiscip. Rev. Data Min. Knowl. Discov.
  • 2012
TLDR
Experimental design is reviewed here for broad classes of data collection and analysis problems, including: fractioning techniques based on orthogonal arrays, Latin hypercube designs and their variants for computer experimentation, efficient design for data mining and machine learning applications, and sequential design for active learning. Expand
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
TLDR
A number of selection schemes commonly used in modern genetic algorithms are compared on the basis of solutions to deterministic difference or differential equations, verified through computer simulations to provide convenient approximate or exact solutions and useful convergence time and growth ratio estimates. Expand
Statistical Principles in Experimental Design
Come with us to read a new book that is coming recently. Yeah, this is a new coming book that many people really want to read will you be one of them? Of course, you should be. It will not make youExpand
Heuristics - intelligent search strategies for computer problem solving
  • J. Pearl
  • Computer Science
  • Addison-Wesley series in artificial intelligence
  • 1984
TLDR
This book presents, characterizes and analyzes problem solving strategies that are guided by heuristic information and provides examples of how these strategies have changed over time. Expand
Automatically generated video previews: user study
  • Human Information Processing Colloquium
  • 2006
Genetic Algorithms in Search and Optimization
  • Genetic Algorithms in Search and Optimization
  • 1989