TY - JOUR
AU - MOSURSKI,, KRZYSZTOF
AB - Abstract Asmussen & Edwards (1983) defined necessary and sufficient conditions for collapsibility of a hierarchical log linear model for a multidimensional contingency table. We have shown that for decomposable log linear models these conditions can be combined with various graph-theoretic algorithms to provide useful classes of sub-tables which are collapsible onto. In particular, the SAHR algorithm finds the minimal set onto which the model can be collapsed and which contains a sub-table of interest. In the context of expert systems, by reducing a probabilistic influence network onto only the relevant nodes, the algorithms reduce the required computation and simplify interpretation This content is only available as a PDF. © 1990 Biometrika Trust
TI - An extension of the results of Asmussen and Edwards on collapsibility in contingency tables
JO - Biometrika
DO - 10.1093/biomet/77.2.315
DA - 1990-06-01
UR - https://www.deepdyve.com/lp/oxford-university-press/an-extension-of-the-results-of-asmussen-and-edwards-on-collapsibility-Jf4O9q3MpD
SP - 315
EP - 319
VL - 77
IS - 2
DP - DeepDyve
ER -