ALCOMFT-TR-03-201

Jaume Baixeries and Jose Balcazar
Discrete Deterministic Data Mining as Knowledge Compilation
Barcelona. Work packages 1 and 4. December 2003.

Abstract: In the subfield of data analysis known as Discrete Deterministic Data Mining, notions from Formal Concept Analysis have been used to design a procedure to construct association rules. Empirically, this method has proved eective in practice for certain relevant tasks. We mathematically prove that these methods, rephrased in a Propositional Logic framework, compute the so-called Empirical Horn Approximation, which is a major model of Knowledge Compilation and is well-known to produce very good practical results in several fields of Artificial Intelligence.

Postscript file: ALCOMFT-TR-03-201.ps.gz (70 kb).