Parameter Optimization Method for Gaussian Mixture Model with Data Evolution

【摘要】 To learn from evolutionary experimental data points effectively,an evolutionary Gaussian mixture model based on constraint consistency(EGMM)is proposed and the corresponding method of parameter optimization is presented.Here,the Gaussian mixture model(GMM)is adopted to describe the data points,and the differences between the posterior probabilities of pairwise points under the current parameters are introduced to measure the temporal smoothness.Then,parameter optimization of EGMM can be realized by evolutionary clustering.Compared with most of the existing data analysis methods by evolutionary clustering,both the whole features and individual differences of data points are considered in the clustering framework of EGMM.It decreases the algorithm sensitivity to noises and increases the robustness of evaluated parameters.Experimental result shows that the clustering sequence really reflects the shift of data distribution,and the proposed algorithm can provide better clustering quality and temporal smoothness.更多还原

【Abstract】 To learn from evolutionary experimental data points effectively,an evolutionary Gaussian mixture model based on constraint consistency(EGMM)is proposed and the corresponding method of parameter optimization is presented.Here,the Gaussian mixture model(GMM)is adopted to describe the data points,and the differences between the posterior probabilities of pairwise points under the current parameters are introduced to measure the temporal smoothness.Then,parameter optimization of EGMM can be realized by evolutionary clustering.Compared with most of the existing data analysis methods by evolutionary clustering,both the whole features and individual differences of data points are considered in the clustering framework of EGMM.It decreases the algorithm sensitivity to noises and increases the robustness of evaluated parameters.Experimental result shows that the clustering sequence really reflects the shift of data distribution,and the proposed algorithm can provide better clustering quality and temporal smoothness.更多还原