首页> 外文会议>Granular Computing, 2005 IEEE International Conference on >Degree of Dependence as Granularity in a Contingency Table
【24h】

Degree of Dependence as Granularity in a Contingency Table

机译:列联表中作为粒度的依赖度

获取原文

摘要

The degree of granularity of a contingency table is closely related with that of dependence of contingency tables. We investigate these relations from the viewpoints of determinantal devisors and determinants. From the results of determinantal divisors, it seems that the devisors provide information on the degree of dependencies between the matrix of the whole elements and its submatrices and the increase of the degree of granularity may lead to that of dependence. However, the other approach shows that a constraint on the sample size of a contingency table is very strong, which leads to the evaluation formula where the increase of degree of granularity gives the decrease of dependency.
机译:列联表的粒度程度与列联表的依赖性密切相关。我们从行列式因子和行列式的角度研究这些关系。从行列式除数的结果来看,除数可以提供有关整个元素矩阵与其子矩阵之间的依存度的信息,而粒度度的增加可能导致依存度的增加。然而,另一种方法表明,对列联表的样本大小的约束非常强,这导致了评估公式,其中粒度的增加使依赖性降低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号