Abstract
The maximum likelihood estimation of hierarchical models for contingency tables is often carried out by the iterative proportional scaling (IPS) procedure. In this paper, we propose local computations of the IPS procedure by partitioning generators. The proposed implementation, called IPSP for short, first partitions generators into several non-overlapping and non-empty blocks, and then adjusts marginal counts in each block locally. To find an approximation to the optimal partition resulting the least complexity, we apply the simulated annealing algorithm. Moreover, local computations can speed up the implementation of the IPS procedure using junction trees. Numerical experiments are presented to illustrate the efficiency of local computations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
