摘要
介绍了目前关联规则挖掘的研究工作 .分两个部分提出了基于动态剪枝的关联规则发现方法 .讨论了如何实施动态剪枝 ,给出了一个基于三元组结构的树式存储结构 ,在此基础上描述了交易数据库中知识发现算法 .并将提出的方法与关联规则挖掘中具有里程碑意义的 Apriori算法进行了对比分析 ,给出了相应的分析结果 。
Introduced present researches on association rule, Mining association rule method based on dynamical pruning was proposed in two parts. Firstly we discuss how to prune dynamically and propose a tree structure whose node is a 3 tuple. Based on the aforementioned we describe this algorithm that can find knowledge in transaction database. Lastly, we have given the experiment result on comparing this algorithm with Apriori algorithm, which was thought of as a landmark in the history of algorithms about association rule mining. The experiment shows that this algorithm is efficient in mining association rule from transaction dataset.
出处
《小型微型计算机系统》
CSCD
北大核心
2004年第10期1850-1852,共3页
Journal of Chinese Computer Systems
基金
南京航空航天大学青年基金 ( s0 2 2 7-0 91)资助
关键词
数据挖掘
关联规则
动态剪枝
data mining
association rule
dynamical pruning
