期刊文献+

基于关联图的频繁闭模式挖掘 被引量:2

Frequent Close Pattern Mining Based on Association Graph
下载PDF
导出
摘要 将关联图的数据挖掘思想应用到频繁闭模式的挖掘中,使用位向量的技术简化项集支持度的计算,构造关联图表示项集间的频繁关系。在此基础上,提出一种频繁闭模式挖掘算法,针对频繁闭模式的特点,结合剪枝策略、子集检测策略、搜索策略等技术手段,优化算法性能。实验结果表明,该算法在时间性能上优于经典的频繁闭模式算法CLOSET。 The data mining thoughts based on association graph was applied to frequent close pattern mining.The calculation of item set support was simplified by using bit vector technique.The frequent relationship among items was expressed by constructing an association graph.Further more,a mining algorithm of frequent close pattern was proposed.According to the characteristics of the frequent closed pattern,the algorithm performance was improved by using pruning method,subset test strategy and search strategy of,etc.The experimental results showed that the algorithm was superior to CLOSET which was the classic algorithm for frequent close pattern mining.
作者 王璇
出处 《辽东学院学报(自然科学版)》 CAS 2011年第2期154-158,163,共6页 Journal of Eastern Liaoning University:Natural Science Edition
关键词 关联图 频繁闭模式 位向量 数据挖掘 association graph frequent close pattern bit vector data mining
  • 相关文献

参考文献9

  • 1PASQUIER N, BASTIDE Y, TAOUIL R, et al. Discove- ring frequent dosed itemsets for association rules [ C ] // BEERI C, BUNEMAN P. Proceedings of 7th International Conference Database Theory. Jerusalem: Springer - Ver- lag, 1999:398-416.
  • 2PEI J, HAN J, MAO R. CLOSET: an efficient algorithm for mining frequent closed itemsets [ C ] // Proc of 2000 ACM SIGMOD Workshop on Research Issues in Data Min- ing and Knowledge Discovery. New York: A CM Press, 2000:21-30.
  • 3ZAKI M J, HSIAO C J. CHARM: an efficient algorithm for closed itemset mining [ C ] //Proc of the 2nd SIAM Int' 1 Conf on Data Mining. Arlington- SIAM Press, 2002 : 12 - 28.
  • 4WANG J, HAN J, PEI J. CLOSET + : searching for the best strategies for mining frequent closed itemsets [ C] // Proceedings of the 9th ACM SIGKDD International Confer- ence on Knowledge Discovery and Data Mining. New York: ACM Press, 2003 : 236 - 245.
  • 5GRAHNE G, ZHU J. Efficiently using prefix -trees in mining frequent itemsets [ C ] //FIMI 03 : Proceedings of the 2003 IEEE ICDM Workshop on Frequent Itemset Min- ing Implementations. Melbourne: IEEE Computer Society, 2003: 110-121.
  • 6SHOW J'Y, ARBEE L, CHEN P. A graph - base ap- proach for discovering various types of association rules [ J]. IEEE Transactions Knowledge and Data Engineering, 2001, 13 (5): 839-845.
  • 7朱玉全,宋余庆.频繁闭项目集挖掘算法研究[J].计算机研究与发展,2007,44(7):1177-1183. 被引量:10
  • 8陈明,史忠植,王文杰.一种有效的基于图的关联规则挖掘算法[J].计算机应用,2006,26(11):2654-2656. 被引量:10
  • 9AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules [ C ]. Proceedings of 1994 International Conference on Very Large Data Bases (VLDB 94). San- tiago: 1994, 487-499.

二级参考文献21

  • 1贾彩燕 倪现君.关联规则挖掘研究述评[J].计算机科学,2003,30(4):145-148.
  • 2AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules[ A]. Proceedings of 1994 International Conference on Very Large Data Bases(VLDB'94) [ C]. Santiago, Chile, 1994. 487-499.
  • 3PARK JS, CHEN MS, YU PS. An Effective Hash-based Algorithm for Mining Association Rules[ A]. Proceedings of 1995 ACM - SIG-MOD International Conference Management of Data(SIGMOD'95) [C]. San Jose, CA, 1995. 175-186.
  • 4SAVASERE A, OMIECINSKI E, NAVATHE S. An Efficient Algorithm for Mining Association Rules in Large Databases[ A]. Proceedings of 1995 International Conference on Very Large Data Bases(VLDB'95) [ C], 1995. 432 - 443.
  • 5TOIVONEN H . Sampling Large Databases for Association Rules[ A]. Proceedings of 1996 International Conference on Very Large Data Bases (VLDB'96) [ C]. Bombay, India, 1996. 134-145.
  • 6BRIN S , MOTWANI R , ULLMAN JD , et al. Dynamic itemset counting and implication rules for market basket data[ J]. ACM SIGMOD Record, 1997,26(2):255.
  • 7HAN J, PEI J, YIN Y. Mining Frequent Patterns without Candidate Generation[ A]. Proceedings of 2000 ACM-SIGMOD International Conference on Management of Data[ C]. Dallas, TX, 2000. 1 - 12.
  • 8YEN SJ, CHEN ALP. An Efficient Approach to Discovering Knowledge from Large Database[ A]. Parallel and Distributed Information Systems - Proceedings of the International Conference[ C], 1996.8 -18.
  • 9YEN SJ, CHEN ALP. A graph-based approach for discovering various types of association roles[ J]. IEEE Transactions on Knowledge and Data Engineering, 2001, 13(5): 839 -845.
  • 10R Agrawal,R Srikant.Fast algorithm for mining association rules[C].The 20th Int'l Conf on VLDB,Santiago,Chile,1994.

共引文献18

同被引文献9

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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