Cart (Loading....) | Create Account
Close category search window
 

A finite ranked poset and its application in visualization of association rules

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Baoqing Jiang ; Inst. of Data & Knowledge Eng., Henan Univ., Kaifeng ; Chong Han ; Xiaohua Hu

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.

Published in:

Granular Computing, 2008. GrC 2008. IEEE International Conference on

Date of Conference:

26-28 Aug. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.