By Topic

Extracting minimal non-redundant association rules from QCIL

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

5 Author(s)
Yun Li ; Sch. of Comput. Sci. & Eng., Shanghai Univ., China ; Zong-tian Liu ; Ling Chen ; Wei Cheng
more authors

The association rules are usually extracted from frequent itemsets (FIs) but the number is enormous, and there are some FIs with the same tidset, so many redundant rules exist in the mined rules. The frequent closed itemsets are adopted in order to reduce the number of FIs and without lose any useful information. With the inherent closure properties in objects and attributes, the concept lattice is very suitable for representing the relation between closed itemsets. In this paper, the quantitative closed itemset lattice(QCIL) is formed with the modified node structure, and a scheme of building QCIL incrementally from database is adopted. The minimal non-redundant rules are that with minimal antecedent and maximal consequent, and they correspond to the set of the least itemsets (SLIT) of the nodes in QCIL. An innovative algorithm of extracting the association rule by using the SLIT is presented, which can directly extract minimal non-redundant association rules from QCIL.

Published in:

Computer and Information Technology, 2004. CIT '04. The Fourth International Conference on

Date of Conference:

14-16 Sept. 2004