Suppoqui算法-基于支持度的频繁集快速产生算法

下载PDF

导出

摘要提出了一种新的关联规则挖掘算法-Suppoqui算法,该算法是通过对集合树进行遍历来求频繁项集,它取消了候选集的求解过程,抛弃了以往传统算法求解频繁项集的思路,因此该算法是高效的。

作者贾俊杰

机构地区西北师范大学数学与信息科学学院

出处《甘肃科技》 2005年第2期88-90,59,共4页 Gansu Science and Technology

关键词数据挖掘关联规则频繁项集集合树

参考文献4

1[1]Agrawal.R,Imielinski. T, Swami. A.Mining association rules between sets of items in large databases. In:Proceedinga of the ACM SIGMOD Conference on Management of Data[M]. Washington D. C,1993.207～216
2[2]Agrawal. R, Srikant. R.Fast algorithm for mining association rules. In: Proceedings of the 20th International Conference on Very Large Databases[M]. Santiago, Chile,1994.478-499
3[3]Pasquier. N,Bastide. Y,Taouil. R and Lakhal. L. Efficient mining of association rules using closed itemset lattices[J]. Information Systems 24(1): 1999,25- 46
4[4]Srikant. R,Agrawal. R.Mining generalized association rules[J]. Future Generation Computer System ,1997,(13):161-180
5[5]Yugami. N, Ohto. Y, Okamoto. S. Fast discovery of interesting rules.In:Proceeding of the 4th Pacific-Asia Conference[M].PAKDD2000, Japan,2000.17-27
6[6]Chen. M.-S.,Han. J and Yu.P.S. Data mining:An overview from a datahase perspective[J].IEEE Transactions on Knowledge and Data Engineering, 1996,8(6):866-883
7Agrawal R et al.Database Mining..A performance Perspective[J].IEEE Transaction on knowledge and Date Engineering,. 1993.
8Agrawal R,Imielinski T,Swami A.Mining association rules between sets of items in large databases[C].In:Bunemuu P,Jajodia S eds.Proceedings of the 1993 ACM SIGMOD Conference on Management of Data. New York: ACM Press. 1993. 207 -216.
9Aggarwal C C，Proc Int Conference Data Engineering，1998年，402页
10Park J S，Proc of ACMSIGMOD Int Conference on Management of Data，1995年，175页

甘肃科技

2005年第2期

内容加载中请稍等...