By Topic

Mining generalized association rules using pruning techniques

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)
Yin-Fu Huang ; Inst. of Electron. & Inf. Eng., Nat. Yunlin Univ. of Sci. & Technol., Taiwan ; Chiech-Ming Wu

The goal of the paper is to mine generalized association rules using pruning techniques. Given a large transaction database and a hierarchical taxonomy tree of the items, we try to find the association rules between the items at different levels in the taxonomy tree under the assumption that original frequent itemsets and association rules have already been generated beforehand In the proposed algorithm GMAR, we use join methods and pruning techniques to generate new generalized association rules. Through several comprehensive experiments, we find that the GMAR algorithm is much better than BASIC and Cumulate algorithms.

Published in:

Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on

Date of Conference: