一种改进的Apriori算法

下载PDF

导出

摘要本文利用频繁项集的一个性质,对Apriori算法中的生成候选项集这一步进行改进,大大减少不必要的计算,从而加快候选项集生成的速度。

作者吴文妹陈国龙

机构地区福州大学数学与计算机学院

出处《福建电脑》 2005年第4期17-17,14,共2页 Journal of Fujian Computer

关键词 APRIORI算法候选项集数据挖掘关联规则频繁项集

参考文献1

1Agrawal R, Mannila H, Srikant R, Toivonen H, and Verkamo V.I. Fast discovery of association rules[A]. In Fayyad UM, Piatetshy-Shapiro G, Smyth P, and Uthurusamy R, editors, Advances in Knowledge Discovery and Data Mining [M]. Chapter 12, 307-328. Menlo Park, California: AAAI/MIT Press,1996.
2Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases[C]. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 207-216. Washington DC: ACM Press NY, May 1993.
3Fayyad UM, Piatetsky-Shapiro G, Smyth P. From data mining to knowledge discovery: and overview[A]. In Fayyad UM, Piatetsky-Shapiro G, Smyth P, and Uthurusamy R, editors, Advances in Knowledge Discovery and Data Mining[M]. Menlo Park, California : AAAI/MIT Press, 1996. 1 -34.
4Sarawagi S, Thomas S, Agrawal R. Integrating association rule mining with relational database systems : alternatives and implications [C]. Proceedings of the ACM SIGMOD conference on Management of Data, 1998. 343-354.
5R Agrawal, R Skikant. Fast algorithms for mining association rules in large databases[C]. Proceeding of the 20th International Conference on Very Large Data Bases, 1994.

福建电脑

2005年第4期

内容加载中请稍等...