By Topic

Research on Algorithm and Application of Mining Fuzzy Association Rules Based on Rapid Prefix 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)
Huijun Li ; Inst. of Electr. Eng., Yanshan Univ., Qinhuangdao, China ; Zhiquan Li

Aiming at the problem of the incisive boundary for mining association rules about quantative data using algorithm about boolean data, this paper gives a series of definitions of fuzzy association rules and proposes a mining algorithm based on prefix tree indexed on support for fuzzy association rules. The algorithm can store fuzzy pattern candidate sets and frequent sets compressibly by constructing prefix tree, which effectively saves the memory cost, besides it only scans database twice. The efficiency of the algorithm is verified by the experiment of evaluating water quality.

Published in:

Pervasive Computing Signal Processing and Applications (PCSPA), 2010 First International Conference on

Date of Conference:

17-19 Sept. 2010