© 1985 by Biometrika Trust
A fast procedure for model search in multidimensional contingency tables
Regional Computing Centre at the University of Copenhagen 2100 Copenhagen, Denmark
Centre of Biomathematics, Institute of Physiology, Czechoslovak Academy of Sciences, Prague, Czechoslovakia
A procedure to select the simplest acceptable models for a multidimensional contingency table is proposed. It is based on two rules: first, that if a model is accepted, then all models that include it are considered to be accepted, and secondly, that if a model is rejected, then all its submodels are considered to be rejected. Two versions are described, one for the class of graphical models, and the other for the class of hierarchical log linear models. Application of both versions to a six-dimensional table is illustrated. The procedure can be regarded as an alternative to fitting all possible models, made computationally feasible by application of the two rules. It is a generalization of the procedure proposed by Havranek (1984), but is in many cases considerably faster.
Key Words: Coherence Contingency table Distributive lattice Graphical model Log linear model Model selection
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
J. D. Callahan and S. W. Sorensen Using TETRAD II as an Automated Exploratory Tool Social Science Computer Review, October 1, 1992; 10(3): 329 - 336. [Abstract] [PDF] |
||||
