As an alternative to Shannon's classical entropy measure of information, an exponential entropy function was proposed by Pal and Pal in 1989 and 1991. To generalize Pal's entropy further, this author introduced two different families of exponential entropies that are one-parameter generalizations of Pal's entropy. The purpose of the present paper is to define weighted entropies corresponding to those one-parameter generalizations. Some properties and examples of such weighted exponential entropies are discussed.
Get full access to this article
View all access options for this article.
References
1.
AgrestiA. (1990) Categorical data analysis. New York: Wiley.
2.
BelisM.GuiasuS. (1968) A quantitative-qualitative measure of information in cybernetic systems. IEEE Transactions on Information Theory, IT-14, 593–594.
3.
GuiasuS. (1977) Information theory with applications. New York: McGraw-Hill.
4.
JumarieG. (1990) Relative information: Theory and applications. Berlin: Springer-Verlag.
5.
KapurJ. N. (1994) Measures of information and their applications. New York: Wiley.
6.
KvålsethT. O. (in press) On exponential entropies. Proceedings of the 2000 IEEE International Conference on Systems, Man, and Cybernetics.
7.
MathaiA. M.RathieP. N. (1975) Basic concepts in information theory and statistics. New Delhi: Wiley Eastern.
8.
PalN. R.PalS. K. (1989) Object-background segmentation using new definitions of entropy. IEEE Proceedings, 136E, 284–295.
9.
PalN. R.PalS. K. (1991) Entropy: A new definition and its applications. IEEE Transactions on Systems, Man, and Cybernetics, 21, 1260–1270.
10.
ShannonC. E. (1948) A mathematical theory of communication. Bell System Technical Journal, 27, 379–423, 623–656.
11.
WickensC. D.HollandsJ. G. (2000) Engineering psychology and human performance. (3rd ed.) Upper Saddle River, NJ: Prentice Hall.
