Minimum entropy estimation of hierarchical random graph parameters for character recognition

We propose a new parameter estimation method called minimum entropy estimation (MEE), which tries to minimize the conditional entropy of the models given the input data. Since there is no assumption in MEE for the correctness of the parameter space of models, MEE will perform not less than the other estimation methods such as maximum likelihood estimation and maximum mutual information estimation, under the condition that the training data size is large enough. In the experiments, the three estimation methods are applied to the parameter estimation of hierarchical random graphs so that their estimation performance can be compared with each other