Unlike previous studies on mixture distributions, a bagging and boosting based convexly combined mixture probabilistic model has been suggested. This model is a result of iteratively searching for obtaining the optimum probabilistic model that provides the maximum p value.

中文翻译：

---

一种基于Bagging和Boosting的凸组合最优混合概率模型

与之前对混合分布的研究不同，已经提出了基于凸组合的混合概率模型的装袋和提升。该模型是迭代搜索以获得提供最大 p 值的最佳概率模型的结果。