Use in Probabilistic Design of the Maximum Entrophy Distribution Based on Ranked Data

Abstract

A new algorithm using the maximum entropy principle is introduced to estimate the probability distribution of a random variable, using directly a ranked sample. It is demonstrated that almost all of the analytical probability distributions can be approximated by the new algorithm. A comparison is made between existing methods and the new algorithm; and examples are given of fitting the new distribution to an actual ranked sample.