期刊文献+

FP-Growth关联算法应用研究 被引量:3

原文传递
导出
摘要 关联规则挖掘用于从大量数据中揭示项集之间的有趣关联或相关联系,是数据挖掘的一项重要研究内容。本文首先对FP-Growth算法进行分析,然后运用该算法分析聚类结果中的学生簇与该簇学生所具有因素的关联关系,实践证明了该算法具有较强的实用性。
作者 石云平
出处 《计算机与信息技术》 2008年第7期12-14,共3页 Computer & Information Technology
  • 相关文献

参考文献2

二级参考文献35

  • 1宋余庆 朱玉全 孙志辉 陈耿.基于FP—Tree的最大频繁项集挖掘及其更新算法.软件学报,2003,14(9):1586—1592[J].http://wwwjos.org.cn/1000-9825/14/1586.htm,:.
  • 2Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proc. of the 20th Int'l Conf. on VLDB. 1994. 487-499.http://www.almaden.ibm.conVcs/people/srikant/papers/vldb94.pdf.
  • 3Bayardo R. Efficiently mining long patterns from databases. In: Haas LM, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1998. 85-93.
  • 4Burdick D, Calimlim M, Gehrke J. Mafia: A maximal frequent itemset algorithm for transactional databases. In: Proc. of the 17th Int'l Conf. on Data Engineering. 2001. 443-452. http://www.cs.cornell.edu/boom/2001 sp/yiu/mafia-camera.pdf.
  • 5Gouda K, Zaki MJ. Efficiently mining maximal frequent itemsets. In: Proc. of the 1st IEEE Int'l Conf. on Data Mining. 2001.163-170. http ://www.cs .tau. ac .il/-fiat/dmsem03/E fficient%20Mining%20Maxmal%20Frequent%20Itemsets%20-%202001 .pdf.
  • 6Wang H, Li QH. An improved maximal frequent itemset algorithm. In: Wang GY, eds. Proc of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, the 9th Int'l Conf (RSFDGrC 2003). LNCS 2639, Heidelberg: Springer-Verlag, 2003. 484-490.
  • 7Zhou QH, Wesley C, Lu BJ. SmartMiner: A depth 1st algorithm guided by tail information for mining maximal frequent itemsets.In: Proc of the IEEE Int'l Conf on Data Mining (ICDM2002). 2002. 570-577. http://www.serviceware.com/pdffiles/datasheets/ServiceWare-Smartminer-Datasheet.pdf.
  • 8Grahne G, Zhu JF. High performance mining of maximal frequent itemsets. In: Proc of the 6th SIAM Int'l Workshop on High Performance Data Mining (HPDM 2003). 2003. 135-143. http://www.cs.concordia.ca/db/dbdm/hpdm03.pdf.
  • 9Agarwal RC, Aggarwal CC, Prasad VVV. Depth 1 st generation of long patterns. In: Proc. of the 6th ACM SIGKDD Int'l Conf on Knowledge Discovery and Data Mining. 2000. 108-118. http://www.cs.tau.ac.il/-fiat/dmsem03/Depth%20First%20Generation%20of%20Long%20Patterns%20-%202000.pdf.
  • 10Wang H, Xiao ZJ, Zhang H J, Jiang SY. Parallel algorithm for mining maximal frequent patterns. In: Zhou XM, ed. Advanced Parallel Processing Technologies (APPT 2003). LNCS 2834, Heidelberg: Springer-Verlag, 2003. 241-248.

共引文献96

同被引文献45

引证文献3

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部