A fast procedure for model search in multidimensional contingency tables.

*(English)*Zbl 0576.62067Summary: 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 the second author [A procedure for model search in multidimensional contingency tables. Biometrics 40, 95-100 (1984)], but is in many cases considerably faster.

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 the second author [A procedure for model search in multidimensional contingency tables. Biometrics 40, 95-100 (1984)], but is in many cases considerably faster.

##### MSC:

62H17 | Contingency tables |