基于TD-FP-growth的模糊关联规则挖掘算法

Algorithm for mining fuzzy association rule based on TD-FP-growth

提出一种基于TD-FP-growth的模糊关联规则挖掘算法.首先,使用3种t-模算子以及由其产生的蕴涵算子计算模糊频繁项的支持度和规则的蕴涵度,产生的关联规则能表示模糊项间的确定性和渐近性逻辑语义;然后,以事务的惟一标识为键值,散列存储每个事务相对FP-tree中每个结点所表示模糊项的隶属度,使TD-FP-growth适用于模糊频繁项的挖掘,并分析了算法的时间和空间复杂度;最后,实验结果表明该算法比基于apriori的模糊频繁项挖掘算法在时间方面更加有效.

An algorithm based on TD-FP-growth is proposed for mining fuzzy association rule, which uses three kinds of t-norm operator to calculate the support degree of fuzzy frequent items, and adopts corresponding implication operator to measure implication degree of fuzzy association rule. The association rule mined by the algorithm can express the logic semantic of graduality and certainty between fuzzy items. Each transaction＇s membership degree versus fuzzy item denoted by FP-tree＇s node is stored by hash technology, and each transaction＇s identifier is regarded as key value, which adapts TD-FP-growth to mine fuzzy frequent items. The time and space complexity of the algorithm are analyzed. The experimental results show that the algorithm is more effective than the fuzzy frequent item mining algorithm based on apriori in term of time.