Preview

Modeling and Analysis of Information Systems

Advanced search

Construction of an Entropy Estimator with a Special Metrics and an Arbitrary Function

https://doi.org/10.18255/1818-1015-2013-6-174-178

Abstract

The paper proposes a generalization of entropy as in [1]. At first, to constract the estimator, we select the metrics on the space of sequances. This metrics is based on a matrix that can be interpreted as an edge coloring of a complete graph with loops. A generalization consists in that instead of using the logarithm in the estimation of the entropy, we apply a similar function which may be arbitrary at the given range. The proposed function is not monotone, so the task of optimizing the average deviation which is a quadratic optimization problem, is solved in the whole space and not on the simplex. The main properties of the estimator, such as asymptotic unbiasedness and power decrease dispersion, are proved in a similar way.

About the Author

N. E. Timofeeva
Institute of Managment
Russian Federation

канд. физ.-мат. наук, зав. кафедрой информатики,

150040, Yaroslavl, Nekrasova Str, 52



References

1. Timofeev E.A. Algorithm for Efficient Entropy Estimation // Modeling and Analysis of Information Systems. Т. 20, No 2. 2013. P. 112–119.

2. Deza M., Deza T. Encyclopedia of Distances. Springer, 2009.

3. Kaltchenko A., Timofeeva N. Entropy Estimators with Almost Sure Convergence and an O(n¯¹) Variance // Advances in Mathematics of Communications. 2008. V. 2, No 1. P. 1–13.


Review

For citations:


Timofeeva N.E. Construction of an Entropy Estimator with a Special Metrics and an Arbitrary Function. Modeling and Analysis of Information Systems. 2013;20(6):174-178. (In Russ.) https://doi.org/10.18255/1818-1015-2013-6-174-178

Views: 855


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)