Determining near-optimal block size for incremental-type expectation maximization (EM) algorithms
展开▼
机译:确定增量式期望最大化(EM)算法的近似最佳块大小
展开▼
页面导航
摘要
著录项
相似文献
摘要
Determining the near-optimal block size for incremental-type expectation maximization (EM) algorithms is disclosed. Block size is determined based on the novel insight that the speed increase resulting from using an incremental-type EM algorithm as opposed to the standard EM algorithm is roughly the same for a given range of block sizes. Furthermore, this block size can be determined by an initial version of the EM algorithm that does not reach convergence. For a current block size, the speed increase is determined, and if the speed increase is the greatest determined so far, the current block size is set as the target block size. This process is repeated for new block sizes, until no new block sizes can be determined.
展开▼