Algorithms for modeling distributions over large alphabets
Alon Orlitsky, S. Sajama, Narayana Santhanam, Krishna Viswanathan, Junan Zhang · 2004
We consider the problem of modeling a distribution whose alphabet size is large relative to the amount of observed data. It is well known that conventional maximum-likelihood estimates do not perform well in that regime. Instead, we find the distribution maximizing the probability of the data's pattern. We derive an efficient algorithm for approximating this distribution. Simulations show that the computed distribution models the data well and yields general estimators that evaluate various data attributes as well as specific estimators designed especially for these tasks