登入選單
返回Google圖書搜尋
A Sort-once Parallel Method for the EM Algorithm
註釋Abstract: "We present a method for implementing the well-known Expectation Maximization or EM algorithm that works in parallel, requires only a moderate amount of primary memory, and requires just a single sort of each of a small number of moderate-sized files. Our method addresses the problems of efficient merging of a large sparse table of expected counts, where this merge is performed across distinct parallel threads of the computation, and efficient redistribution of the reestimated model parameters. We have implemented this method and used it to build a link grammer language model."