By Topic

A Breadth-First Search Algorithm for Mining Generalized Frequent Itemsets Based on Set Enumeration Tree

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
$33 $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 one of important research area in data mining. If we use the traditional methods, it will meet two basic problems, the first is low efficiency in generating generalized frequent itemsets with the items and levels of taxonomy increasing, and the second is that too much redundant itemsets' support are counted. This paper proposes an improved Breadth-First Search method to mine generalized association rules. The experiments on the real-life data show that our method outperforms the well-known and recent algorithms greatly.

Published in:

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

Date of Conference:

13-15 Oct. 2008