© 1977 by Biometrika Trust
A comparison of iterative methods for obtaining maximum likelihood estimates in contingency tables with a missing diagonal
Mathematical Institute, University of Kent Canterbury
Department of Statistics, University of Glasgow
This paper considers maximum likelihood estimation for the parameters of quasiindepen-dence in a contingency table with a miiming or excluded diagonal. Two of the methods discussed derive from the em algorithm of Dempster, Laird & Rubin (1977), the other two methods being Newton-Raphson and iterative scaling. Iterative scaling is found, empirically, to be the least efficient method.
Key Words: Convergence em algorithm Iterative scaling Mover-stayer NewtonRaphson Quasiindependence