摘要
介绍了一种基于Hash＿tree的产生关联规则的方法。在此方法中通过在候选集排序和在获得项集出现次数的时候采用了Hash＿tree的方法大大提高了算法实现的速度,并在实际应用中也取得了很好的效果。
This paper provides a method of obtaining frequent itemset from association rules based on Hash_-tree quick research itemset. The method of Hash_-tree which is used to array the candidate set of itemsets and obtain their times observably increase speed of realizing algorithm, and achieves great effect in practice.
出处
《南昌大学学报（理科版）》
CAS
北大核心
2004年第2期197-200,204,共5页
Journal of Nanchang University(Natural Science)
