PubMed · 2382966
Counting algorithms for linkage.
Abstract
The Lander-Green algorithm is algebraically different from the EM algorithm that maximizes likelihood. In our experience the numerical difference is very small. Since computations are no easier or convergence faster for the Lander-Green algorithm, there is no reason to prefer it to EM. As suggested by Green (personal communication), layering is advantageous. Occasional updating of the information weights might also be considered to accelerate mapping.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
N E Morton, A Collins. 1990. Counting algorithms for linkage.. https://doi.org/10.1111/j.1469-1809.1990.tb00365.x. https://pubmed.health/record/pubmed%3A2382966/counting-algorithms-for-linkage
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite PubMed Health by Indiciae: BibTeX · RIS.