论文信息 - On functions defined on free Boolean algebras

On functions defined on free Boolean algebras

We characterize measures on free Boolean algebras and we examine the relationships that exists between measures and binary tables in relational databases. It is shown that these measures are completely defined by their values on positive conjunctions and an algorithm that leads to the construction of measures starting from its values on a positive conjunction is also given, including a formula that allows the evaluation of measures for arbitrary polynomials. Finally, we study pairs of measures generated by ternary tables, i.e. by tables that contain missing or unknown values.

Szymon Jaroszewicz | Dan A. Simovici | Ivo G. Rosenberg

[1] Heikki Mannila,et al. Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data , 2003, IEEE Trans. Knowl. Data Eng..

[2] Jean-Marc Adamo,et al. Data Mining for Association Rules and Sequential Patterns , 2000, Springer New York.

[3] Heikki Mannila. Combining Discrete Algorithmic and Probabilistic Approaches in Data Mining , 2001, PKDD.

[4] Petra Perner,et al. Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[5] Sergiu Rudeanu. Boolean functions and equations , 1974 .

[6] P. Halmos. Lectures on Boolean Algebras , 1963 .