CAJ | 학술논문

该算法结合项集的有序特性有效压缩了频繁项集的数量,提高了算法效率,但是频繁2_项集的产生仍需要占用大量的存储空间,本文利用散列函数对候选频繁2_项集进行剪枝,这样频繁集的数目大大减少,不仅节省了存储空间、减少了计算开销,而且又保持了频繁项集的完整性.
해산법결합항집적유서특성유효압축료빈번항집적수량,제고료산법효솔,단시빈번2_항집적산생잉수요점용대량적존저공간,본문이용산렬함수대후선빈번2_항집진행전지,저양빈번집적수목대대감소,불부절성료존저공간、감소료계산개소,이차우보지료빈번항집적완정성.
It combines the ordinal character of itemsets to reduce the number of the frequent itemsets in order to improve the efficiency of algorithm.But the frequent 2-itemsets still require much store space,it proposes a new method of pruning to improve the algorithm,that is,hash function id applied to prune candidate frequent 2-itemsets,and the number of the frequent itemsets can be greatly reduced .So,not only the cost of computing is reduced and the store space is saved,but also the completness of frequent itemsets are kept.