Date: 19 Oct 2006

Classes of four-fold table quantifiers

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Four-fold table logical calculi are defined. Formulae of these calculi correspond to patterns based on four-fold contingency tables of two Boolean attributes. An FFT quantifier is a part of the formula, it corresponds to an assertion concerning frequencies from four-fold table. Several classes of FFT quantifiers are defined and studied. It is shown that each particular class has interesting properties from the point of view of KDD. Deduction rules concerning formulae of four-fold tables calculi are demonstrated. It is shown that complex computation of statistical tests can be avoided by using tables of critical frequencies.