2000 character limit reached
A Bagging and Boosting Based Convexly Combined Optimum Mixture Probabilistic Model
Published 8 Jun 2021 in cs.LG, math.ST, stat.AP, stat.CO, stat.ME, and stat.TH | (2106.05840v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.