Skip to Main Content
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.
Date of Conference: 17-19 Sept. 2010