Close category search window
 

Research of an association rule mining algorithm based on FP 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
$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)
Li Juan ; Comput. & Inf. Eng. Inst., Jiangxi Agric. Univ., Nanchang, China ; Ming De-ting

Based on analyzing an association rule mining algorithm called FP tree, a new association rule mining algorithm called QFP was presented. Through scanning the database only once, the QFP algorithm can convert a transaction database into a QFP tree after data preprocessing, and then do the association rule mining of the tree. The QFP algorithm is more integrity than the FP_growth algorithm, and retain the complete information for mining frequent patterns; it will not destroy the long pattern of any transaction, and significantly reduce the non-relevant information. Experiments show that the QFP algorithm is more efficient if the aspect of time than the FP_growth algorithm.

Published in:
Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on  (Volume:1 )

Date of Conference: 29-31 Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.