Lazy Associative Classification
Lazy Associative Classification
复制标题
DOI：
10.1109/icdm.2006.96
复制
发表时间：
2006-12
期刊：
影响因子：
--
通讯作者：
Adriano Veloso;Wagner Meira Jr;Mohammed J. Zaki
中科院分区：
文献类型：
--
作者：
Adriano Veloso;Wagner Meira Jr;Mohammed J. Zaki
决策树分类器通过启发式选择最有希望的特征来执行对规则的贪婪搜索。这种贪婪（局部）搜索可能会丢弃重要的规则。另一方面，关联分类器对满足某些质量约束（即最小支持）的规则执行全局搜索。然而，这种全局搜索可能会生成大量规则。此外，这些规则中的许多在分类过程中可能是无用的，并且最糟糕的、重要的规则可能永远不会被挖掘。惰性（非热切）关联分类通过关注给定测试实例的特征来克服这个问题，增加生成更多可用于对测试实例进行分类的规则的机会。在本文中，我们评估了惰性关联分类的性能。首先，我们证明关联分类器的性能并不比相应的决策树分类器差。我们还证明了惰性分类器优于相应的热切分类器。我们的主张得到了大量实验结果的实证证实。我们表明，与急切的对应分类器相比，我们提出的惰性关联分类器的错误率降低了约 10%，与决策树分类器相比，错误率降低了 20%。简单的缓存机制使惰性关联分类变得快速，因此也观察到执行时间的改进。
Decision tree classifiers perform a greedy search for rules by heuristically selecting the most promising features. Such greedy (local) search may discard important rules. Associative classifiers, on the other hand, perform a global search for rules satisfying some quality constraints (i.e., minimum support). This global search, however, may generate a large number of rules. Further, many of these rules may be useless during classification, and worst, important rules may never be mined. Lazy (non-eager) associative classification overcomes this problem by focusing on the features of the given test instance, increasing the chance of generating more rules that are useful for classifying the test instance. In this paper we assess the performance of lazy associative classification. First we demonstrate that an associative classifier performs no worse than the corresponding decision tree classifier. Also we demonstrate that lazy classifiers outperform the corresponding eager ones. Our claims are empirically confirmed by an extensive set of experimental results. We show that our proposed lazy associative classifier is responsible for an error rate reduction of approximately 10% when compared against its eager counterpart, and for a reduction of 20% when compared against a decision tree classifier. A simple caching mechanism makes lazy associative classification fast, and thus improvements in the execution time are also observed.