A. Perez, #-admissible simplification of the dependence structure of a set of random variables, Kybernetika 13 (1977), pp. 439--450.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....two random variables, namely the mutual information [7, 3] It is always nonnegative and vanishes iff the corresponding two random variables 2 are stochastically independent. On the other hand it achieves its maximal value iff one random variable is a function of the other variable [28] Perez [15] wanted also to express numerically the degree of stochastic dependence among any finite number of random variables and proposed a numerical characteristic called dependence tightness . Later he changed the terminology, started to call that characteristic systematically multiinformation and ....

....(corresponding to [ i ] i2N ) assigns the multiinformation of the subcollection [ i ] i2A to every A ae N . Such a function was mentioned already in sixties by Watanabe [25] under name total cohesion function . Some pleasant properties of the multiinformation function were utilized by Perez [15] in probabilistic decisionmaking. Malvestuto named the multiinformation function entaxy and applied it in the theory of relational databases [9] The multiinformation function plays an important role in the problem of finding optimal dependence structure simplification solved in thesis [21] ....

Perez, A. (1977) "-admissible simplifications of the dependence structure of a set of random variables, Kybernetika, 13, 439--449.

No context found.

A. Perez, #-admissible simplification of the dependence structure of a set of random variables, Kybernetika 13 (1977), pp. 439--450.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC