
A Modulo-Based Computation for Kendall’s Phi Test for 2 by 2 Contingency Table
Author(s) -
Ray-Ming Chen
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1789/1/012009
Subject(s) - contingency table , modulo , statistic , computation , test statistic , algorithm , mathematics , computer science , statistical hypothesis testing , statistics , theoretical computer science , discrete mathematics
Kendall’s Phi Test is very important technique in testing whether there exists a significant relation between variables under some known levels of experiments. However, the typical statistical testing would utilise some complex probability distribution for the statistic. In this article, we put forward a computational approach to effectively linearize Kendall’s Phi coefficients based on modulo operation. In our approach, the confidence levels would serve the threshold of the operation. Unlike typical approach which lists the whole distribution of the statistic, our method would concentrate only on the accumulated values needed. Such computation has merits in visualization and programming. In particular, if one is interested in Kendall’s Phi-based test, then this approach could largely reduce the complexity and computational time.