By Topic

An Improved Method for Mining Generalized Frequent Itemsets Based on the Correlation between Items

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)
Yu Xing Mao ; Dept. of Comput. & Inf. Technol., Fudan Univ., Shanghai ; Bai Le Shi

Mining generalized association rules is closely related to the taxonomy(is-a hierarchy) data which exists widely in retail, geography, biology and financial domains. If we use traditional method to mine the generalized association rules, it becomes inefficient because the itemsets will be huge along with the items and levels of taxonomy increasing, and it also wastes lots of time to calculate the support of redundant or unnecessary itemsets. In this paper, we proposes a new efficient method called CBP to partition the transaction database into several smaller ones level by level using correlation of itemsets, which make the mining more efficient by reducing the scanning size of transaction database. By experiments on the real-life transaction database, the results show that our CBP_based algorithms outperform the well-known algorithms.

Published in:

Computer Science and its Applications, 2008. CSA '08. International Symposium on

Date of Conference:

13-15 Oct. 2008