摘要
数据挖掘中的关联规则挖掘近些年一直是人们研究的热点。但是关联规则挖掘的经典算法Apriori存在着挖掘效率低、系统开销大等问题。AprioriTid、DIC等算法,也仅从某一方面进行了改进。针对上述问题,提出了一种新的改进算法,新算法从三大方面对原有的算法进行了改进,以此提高算法的效率,降低系统的开销。
Data mining association rules in recent years has been one of the hot spots.However,the classical association rules mining algorithm Apriori has low efficiency,large overhead and other issues.There has been AprioriTid,DIC and other algorithms,but only from a particular aspect of all improvement.In response to these problems,we propose a new improved algorithm,the new algorithm improves the original algorithm from three aspects in order to improve the algorithm efficiency and reduce system overhead.
出处
《微型机与应用》
2011年第8期1-3,7,共4页
Microcomputer & Its Applications