交互信息量的可压缩性
Collapsibility of Mutual Information
-
摘要: 当随机向量(V_1,V_2,V_3)的分布是I\timesJ\times K列联表时, 本文研究了熵的可压缩性, 在次条件独立的条件下,我们进一步获得了交互信息量简单可压缩和强可压缩的条件.Abstract: hen the distribution of random variable V_1,V_2 and V_3 composes an I\times J\times K contingency table, this paper research the collapsibility of entropy, and present necessary and sufficient conditions for simple collapsibility and strong collapsibility of mutual information by the research on collapsibility of entropy, which are considered under the condition of sub-independence.