By Topic

An Efficient Data Structure for Mining Generalized 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

2 Author(s)
Chieh-Ming Wu ; Grad. Sch. of Eng. Sci. & Technol., Nat. Yunlin Univ. of Sci. & Technol., Touliu ; Yin-Fu Huang

The goal of this paper is to use an efficient data structure to improve our earlier research. In the earlier research, we attempted to find the generalized association rules between the items at different levels in the taxonomy tree under the assumption that the original frequent itemsets and association rules were generated in advance. In the paper, we proposed an efficient data structure called a frequent closed enumeration table (FCET) to store the relevant information using a well-known algorithm. It stores only maximal itemsets, and can be used to derive the information of the subset itemsets in a maximal itemset through a hash function. From experimental results, we found that the combinations of FCET and the hash function not only save spaces, but also speed up producing the generalized association rules.

Published in:

Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on  (Volume:2 )

Date of Conference:

18-20 Oct. 2008