Contingency matrix theory : Statistical dependence in a contingency table
Contingency matrix theory : Statistical dependence in a contingency table
复制标题
列联矩阵理论:列联表中的统计依赖性
DOI:
10.1016/j.ins.2008.11.023
复制
发表时间:
2009
影响因子:
8.1
通讯作者:
Shusaku Tsumoto
中科院分区:
文献类型:
--
作者:
Masao OKABE;Akiko YOSHIOKA;Keido KOBAYASHI;Takahira YAMAGUCHI;Shusaku Tsumoto
Chance discovery aims at understanding the meaning of functional dependency from the viewpoint of unexpected relations. One of the most important observations is that such a chance is hidden under a huge number of coocurrencies extracted from a given data. On the other hand, conventional data-mining methods are strongly dependent on frequencies and statistical or dependence rather than interestingness or unexpectedness. This paper discusses some limitations of ideas of statistical dependence, especially focusing on the formal characteristics of Simpson’s paradox from the viewpoint of linear algebra. Theoretical results show that such a Simpson’s paradox can be observed when a given contingency table as a matrix is not regular, in other words, the rank of a contingency matrix is not full. Thus, data-ordered evidence gives some limitations, which should be compensated by human-oriented reasoning.