By Topic

A high efficient AprioriTid algorithm for mining association rule

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

3 Author(s)
Zhi-Chao Li ; Sch. of Electron. Inf. Eng., Tianjin Univ., China ; Pi-Lian He ; Ming Lei

Mining association rule is one of the common forms in data mining, in which the critical problem is to gain the frequent itemsets efficiently. The classical Apriori and AprioriTid algorithm, which are used to construct the frequent itemset, are analyzed in this paper. Author finds out that there too many data due to those items repeatedly saved in the AprioriTid algorithm. On the basis of analysis, we give a theorem of the itemset whose support is less than minsup in C k-1 is useless in C k-1. Then, HEA algorithm based on the theorem is offered. The experiments show that the new algorithm is more effective in decreasing data size and execution times than AprioriTid algorithm.

Published in:

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on  (Volume:3 )

Date of Conference:

18-21 Aug. 2005