摘要
介绍了关联规则挖掘的研究情况,并在分析关联规则的数据挖掘算法的基础上,针对Apriori算法进行深入研究,提出了Apriori-1算法,新算法在计算候选大项集支持度所涉及的记录数目将小于事务数据库中原始的记录数目,提高了原算法的效率,具有一定的实用性。
This paper provides a survey of the study in association rule generation, and on the basis of analyzing theory of mining association rules, analyzes the Apriori algorithm and presents an Apriori-1 algorithm. On the aspect of calculating candidate large item set support degrees concerning record numbers, the new algorithm is less than records numbers in work DB. It improves the efficiency of original algorithm. The Apriori-1 algorithm is practical.
出处
《大连铁道学院学报》
2003年第2期56-59,共4页
Journal of Dalian Railway Institute
