Classes of four-fold table quantifiers

  • Jan Rauch
Communications Session 8. Attribute Selection

DOI: 10.1007/BFb0094821

Volume 1510 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Rauch J. (1998) Classes of four-fold table quantifiers. In: Żytkow J.M., Quafafou M. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1998. Lecture Notes in Computer Science, vol 1510. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Jan Rauch
    • 1
  1. 1.Laboratory of Intelligent Systems, Faculty of Informatics and StatisticsUniversity of EconomicsPragueCzech Republic