期刊文献+

基于频繁模式表的关联分类器构建算法研究

RESEARCH ON FREQUENT PATTERN LIST BASED ASSOCIATIVE CLASSIFIER CONSTRUCTION ALGORITHM
下载PDF
导出
摘要 关联分类具有较高的分类精度和较强的适应性。基于闭频繁项集有效压缩事务及FPL(Frequent Pattern List)简单数据结构等方面的优点,提出了一种关联分类器方法。设计了便于分类的FPL变形模式,引入了有效发现闭频繁项集的签名向量合取操作。将闭频繁项集挖掘方法应用于关联分类,提高了关联分类算法的分类效率及准确率。 Associative classification bears fairly high classification accuracy and fairly robust suitability.Based on closed frequent itemset effective compression transaction,FPL(Frequent Pattern List) simple data structure and other merits,the article proposes an associative classifier method,designs a modified FPL pattern to ease classification,and introduces signature vector conjunction operation that effectively discovers closed frequent itemsets. When the closed frequent itemset mining method is applied to associative classification,the classification efficiency and accuracy of the associative classification algorithm is upgraded.
出处 《计算机应用与软件》 CSCD 2011年第6期39-42,共4页 Computer Applications and Software
基金 国家自然科学基金项目(10961017)
关键词 关联分类 分类器 闭频繁项集 向量合取 频繁模式表 Associative classification Classifier Closed frequent itemset Vertex conjunction Frequent Pattern List(FPL)
  • 相关文献

参考文献3

二级参考文献13

  • 1颜跃进,李舟军,陈火旺.基于FP-Tree有效挖掘最大频繁项集[J].软件学报,2005,16(2):215-222. 被引量:68
  • 2秦亮曦,史忠植.SFPMax——基于排序FP树的最大频繁模式挖掘算法[J].计算机研究与发展,2005,42(2):217-223. 被引量:26
  • 3陆介平,杨明,孙志挥,鞠时光.快速挖掘全局最大频繁项目集[J].软件学报,2005,16(4):553-560. 被引量:27
  • 4宋余庆,朱玉全,孙志挥,杨鹤标.一种基于频繁模式树的约束最大频繁项目集挖掘及其更新算法[J].计算机研究与发展,2005,42(5):777-783. 被引量:21
  • 5A Ceglar, J F Roddick. Association mining [J]. ACM Computing Surveys, 2006, 38(2) : 1-42.
  • 6N Pasquier, Y Bastide, R Taouil, et al. Discovering frequent closed itemsets for association rules [C]. In: Proc of the 7th Int'l Conf on Database Theory. London: Springer-Verlag, 1999. 398-416.
  • 7J Pei, J Han, R Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets [C]. In: Proc of 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. New York: ACM Press, 2000. 21-30.
  • 8J Y Wang, J Han J, J Pei. CLOSET + : Searching for the best strategies for mining frequent closed itemsets [C]. In: Proc of the 9th ACM SIGKDD Int'l Conf on Knowledge Discovery and Data Mining. New York: ACM Press, 2003. 236-245.
  • 9G Grahne, J Zhu. Fast algorithms for frequent itemset mining using prefix-trees [J]. IEEE Trans on Knowledge and Data Engineering, 2005, 17(10): 1347-1362.
  • 10M J Zaki, C J Hsiao. CHARM: An efficient algorithm for closed itemset mining [C]. In: Proc of the 2nd SIAM Int'l Conf on Data Mining. Arlington, USA: SIAM Press, 2002. 12 -28.

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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