Title :
A finite ranked poset and its application in visualization of association rules
Author :
Jiang, Baoqing ; Han, Chong ; Hu, Xiaohua
Author_Institution :
Inst. of Data & Knowledge Eng., Henan Univ., Kaifeng
Abstract :
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.
Keywords :
Boolean functions; data mining; set theory; Boolean association rules; association rules visualization; data mining; finite ranked poset; special partial order; Association rules; Data mining; Data visualization; Deductive databases; Fiber reinforced plastics; Information processing; Itemsets; Knowledge engineering;
Conference_Titel :
Granular Computing, 2008. GrC 2008. IEEE International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-2512-9
Electronic_ISBN :
978-1-4244-2513-6
DOI :
10.1109/GRC.2008.4664764
