首页> 外文期刊>Data & Knowledge Engineering >A tree-projection-based algorithm for multi-label recurrent-item associative-classification rule generation
【24h】

A tree-projection-based algorithm for multi-label recurrent-item associative-classification rule generation

机译:基于树投影的多标签递归关联分类规则生成算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Associative-classification is a promising classification method based on association-rule mining. Significant amount of work has already been dedicated to the process of building a classifier based on association rules. However, relatively small amount of research has been performed in association-rule mining from multi-label data. In such data each example can belong, and thus should be classified, to more than one class. This paper aims at the most demanding, with respect to computational cost, part in associative-classification, which is efficient generation of association rules. This task can be achieved using different frequent pattern mining methods. In this paper, we propose a new method that is based on the state-of-the-art tree-projection-based frequent pattern mining algorithm. This algorithm is modified to improve its efficiency and extended to accommodate the multi-label recurrent-item associative-classification rule generation. The proposed algorithm is tested and compared with A priori-based associative-classification rule generator on two large datasets.
机译:关联分类是一种基于关联规则挖掘的有前途的分类方法。大量工作已经投入到基于关联规则构建分类器的过程中。然而,从多标签数据中进行关联规则挖掘的研究相对较少。在这样的数据中,每个示例都可以属于一个以上的类别,因此应该被分类。就计算成本而言,本文针对最苛刻的需求进行关联分类,即有效生成关联规则。可以使用不同的频繁模式挖掘方法来完成此任务。在本文中,我们提出了一种基于最新的基于树投影的频繁模式挖掘算法的新方法。对该算法进行了修改以提高其效率,并扩展为适应多标签重复项关联分类规则生成。对所提出的算法进行了测试,并与两个大型数据集上的基于先验的关联分类规则生成器进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号