A finite ranked poset and its application in visualization of association rules
Baoqing Jiang, Chong Han, Xiaohua Tony Hu · 2008
We discuss the set of all Boolean association rules. By defining special partial order on the set, we get an isomorphism between the set and a special finite ranked poset. Through discussing some basic properties of the finite ranked poset, we can clearly represent the hierarchical structure of all Boolean association rules. Meanwhile, the Hasse diagram of the poset offers a visualization view of the structure.