By Topic

Mining Non-redundant Rules for Redescription Datasets Based on FCA

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

2 Author(s)
Wei Yuanyuan ; Coll. of Comput. Sci., Wuhan Univ. of Sci. & Eng., Wuhan, China ; Wei Min

The notions and algorithms of generating basis for exactness rules and the proper basis for conditional rules of redescription database are presented using closure operator of Galois connection based on the operations of formal concept analysis (FCA). It is demonstrated that constructed rules of redescription database are minimal non-redundant. At the same time, a new algorithm, i.e. non-redundant rules method (NRRM), is employed to discover minimal non-redundant exactness, and the conditional rules are addressed. In addition, part numerical computation program and detailed resolution of NRRM algorithm are presented to verify the proposed theorem. It is found that the theorem has good application to practical cases.

Published in:

Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2010 International Conference on

Date of Conference:

10-12 Oct. 2010