This is the authors' abstract. We don't add key points for this paper.
We propose an Gaussian Mixture Model (GMM) learning algorithm, based on our previous work of GMM expansion idea. The new algorithm brings more robustness and simplicity than classic Expectation Maximization (EM) algorithm. It also improves the accuracy and only take 1 iteration for learning. We theoretically proof that this new algorithm is guarantee to converge regardless the parameters initialisation. We compare our GMM expansion method with classic probability layers in neural network leads to demonstrably better capability to overcome data uncertainty and inverse problem. Finally, we test GMM based generator which shows a potential to build further application that able to utilized distribution random sampling for stochastic variation as well as variation control.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Lu et al. (2023) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: