6533b858fe1ef96bd12b57ee
RESEARCH PRODUCT
Information potential for some probability density functions
Gülen Başcanbaz-tuncaIoan RaşaAna Maria Acusubject
Discrete mathematics0209 industrial biotechnologyApplied MathematicsComputation020206 networking & telecommunicationsProbability density function02 engineering and technologyExpected valueStatistical powerConvexityComputational Mathematics020901 industrial engineering & automation0202 electrical engineering electronic engineering information engineeringKurtosisEntropy (information theory)Mathematicsdescription
Abstract This paper is related to the information theoretic learning methodology, whose goal is to quantify global scalar descriptors (e.g., entropy) of a given probability density function (PDF). In this context, the core concept is the information potential (IP) S [ s ] ( x ) : = ∫ R p s ( t , x ) d t , s > 0 of a PDF p(t, x) depending on a parameter x; it is naturally related to the Renyi and Tsallis entropies. We present several such PDF, viewed also as kernels of integral operators, for which a precise relation exists between S[2](x) and the variance Var[p(t, x)]. For these PDF we determine explicitly the IP and the Shannon entropy. As an application to Information Theoretic Learning we determine two essential indices used in this theory: the expected value E[log p(t, x)] and the variance Var[log p(t, x)]. The latter is an index of the intrinsic shape of p(t, x) having more statistical power than kurtosis. For a sequence of B-spline functions, considered as kernels of Steklov operators and also as PDF, we investigate the sequence of IP and its asymptotic behaviour. Another special sequence of PDF consists of kernels of Kantorovich modifications of the classical Bernstein operators. Convexity properties and bounds of the associated IP, useful in Information Theoretic Learning, are discussed. Several examples and numerical computations illustrate the general results.
year | journal | country | edition | language |
---|---|---|---|---|
2021-01-01 | Applied Mathematics and Computation |