摘要
为改进现有模糊关联规则挖掘算法的不足,提出了一种基于线性链表的模糊关联规则挖掘算法。算法利用线性链表只存储有用的事务数据库信息,并不断利用前期的运算结果对之进行简化,减少了数据的存储开销及扫描时间,降低了算法的时间复杂度,提高了算法的效率。比较分析以及实验表明,该算法对于挖掘模糊关联规则是快速而有效的。
In order to improve the efficiency of existing fuzzy association rule mining algorithms, we presented a linear linklist based algorithm for fuzzy association rule mining. Utilizing the linear linklist our algorithm only records the information of the tran-sactions which are useful for counting the support of the frequent itemset, and simplifies the transactions information according to the previous results, which reduces the cost of data storage and increases the running efficiency. Experiments demonstrate that our method is efficient in fuzzy association rule mining.
出处
《计算机科学》
CSCD
北大核心
2012年第3期135-138,共4页
Computer Science
基金
国家自然科学基金(70771110)资助
关键词
数据挖掘
模糊关联规则
线性链表
Data mining, Fuzzy association rule, Linear linklist