期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

频繁模式挖掘中基于CFP的应用模型 被引量：2

Application Model Based on CFP in Mining Frequent Patterns
下载PDF
导出
摘要 为进一步提高频繁模式挖掘效率,对CFP构造算法做了部分改进,并提出了一些基于此结构的应用方法.实验和分析表明,改进的CFP算法在各种不同的数据挖掘应用中更加有效. In order to further improve the efficiency of frequent patterns mining,the CFP construction algorithm is improved and some applications on this structure are proposed.The experiments demonstrate that,the improved CFP algorithm can make different applications more effective and efficient.
作者 陈冬玲 曾文
机构地区 沈阳大学信息科学与工程学院 中国科学技术信息研究所
出处 《沈阳大学学报（自然科学版）》 CAS 2015年第4期296-300,339,共6页 Journal of Shenyang University：Natural Science
基金 辽宁省博士启动基金资助项目(20101074) 国家社会科学基金资助项目(14BTQ038) 中国科学技术信息研究所科研项目预研资金资助项目(YY-201416)
关键词 频繁模式 挖掘算法 应用方法 CFP frequent pattern mining algorithm application method CFP
分类号 TP274 [自动化与计算机技术—检测技术与自动化装置]
  • 相关文献

参考文献16

  • 1Han J, Dong G, Yin Y. Efficient Mining of Partial Periodic Patterns in Time Series Database [ C~ ff Proceedings of 15th International Conference on Data Engineering, Sydney, NSW, 1999. Washington, I)(2.. IEEE Computer Society, 1999:106 - 115.
  • 2Han J, Pei J, Yin Y. Mining Frequent Patterns without Candidate Generation[C]//Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000. New York: ACM, 2000:1- 12.
  • 3Xin D, Han J, Yan X, et al. Mining Compressed Frequent-Pattern Sets[C]//Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, 2005. VLDB Endowment, 2005: 709 - 720.
  • 4Borgelt C. Keeping Thing Simple: Finding Frequent Item Sets by Recursive Elimination[C]//Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, Chicago, USA, 2005. New York: ACM, 2005:66-70.
  • 5Liu G, Lu H, Lou W, et al. On Computing, Storing and Querying Frequent Patterns[C]//Proceedings of the 9th ACM SIGKDD International Conference on KnowledgeDiscovery and Data Mining, Washington, DC, USA, 2003. New York: ACM, 2003:607 - 612.
  • 6Liu G, Lu H, Yu J X. CFP-Tree: A Compact Disk- Based Structure for Storing and Querying Frequent Itemsets[J]. Information Systems, 2007, 32 (2) : 295 -319.
  • 7Gade K, Wang J, Karypis G.. Efficient Closed Pattern Mining in the Presence of Tough Block Constraints[C]// Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004. New York: ACM, 2004:138- 147.
  • 8Hou J, Li C. A Pattern Growth Method Based on Memory Indexing for Frequent Pattems Mining[C]// International Conference on Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, Vienna, 2005. IEEE: 663 - 668.
  • 9Tseng F, Hsu C. Generating Frequent Pattern with the Frequent Pattern List[C]//Proceedings of the 5th Pacific- Asia Conference on Knowledge Discovery and Data Mining, Hong Kong, China, 2001. London: Springer- Verlag, 2001 : 376 - 386.
  • 10Chen Y, Hu Y. Constraint-Based Sequential Pattern Mining: The Consideration of Recency and Compactness EJ]. Decision Support Systems, 2006, 42 (2): 1203 - 1215.

二级参考文献4

共引文献2

同被引文献7

引证文献2

二级引证文献8

沈阳大学学报（自然科学版）
2015年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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