Maximising entropy on the nonparametric predictive inference model for multinomial data

The combination of mathematical models and uncertainty measures can be applied in the area of data mining for diverse objectives with as final aim to support decision making. The maximum entropy function is an excellent measure of uncertainty when the information is represented by a mathematical model based on imprecise probabilities. In this paper, we present algorithms to obtain the maximum entropy value when the information available is represented by a new model based on imprecise probabilities: the nonparametric predictive inference model for multinomial data (NPI‐M), which represents a type of entropy‐linear program. To reduce the complexity of the model, we prove that the NPI‐M lower and upper probabilities for any general event can be expressed as a combination of the lower and upper probabilities for the singleton events, and that this model can not be associated with a closed polyhedral set of probabilities. An algorithm to obtain the maximum entropy probability distribution on the set associated with NPI‐M is presented. We also consider a model which uses the closed and convex set of probability distributions generated by the NPI‐M singleton probabilities, a closed polyhedral set. We call this model A‐NPI‐M. A‐NPI‐M can be seen as an approximation of NPI‐M, this approximation being simpler to use because it is not necessary to consider the set of constraints associated with the exact model.