By Topic

Mining fuzzy association rules using partial support

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-Jun Xu ; Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., China ; Kang-Lin Xie

The paper presents a new approach of mining fuzzy association rules. Most existing methods need to perform multiple scans of the database to get frequent itemsets and work poorly if the data are densely populated and duplicated. Our approach only needs one scan to build the fuzzy P-tree, which is a variant of a set enumeration tree. The tree is stored with partial fuzzy support values of candidate itemsets, which facilitate the calculation of total fuzzy support values. We describe the implementation of our algorithm derived from a priori algorithm. The fuzzy P-tree can be combined with many existing methods and significantly improve their efficiency.

Published in:

Machine Learning and Cybernetics, 2003 International Conference on  (Volume:1 )

Date of Conference:

2-5 Nov. 2003