HARMONY: Efficiently Mining the Best Rules for Classification
HARMONY: Efficiently Mining the Best Rules for Classification
复制标题
DOI:
10.1137/1.9781611972757.19
复制
发表时间:
2005-12
期刊:
影响因子:
--
通讯作者:
Jianyong Wang;G. Karypis
中科院分区:
文献类型:
--
作者:
Jianyong Wang;G. Karypis
Many studies have shown that rule-based classiers perform well in classifying categorical and sparse high-dimensional databases. However, a fundamental limitation with many rule-based classiers is that they nd the rules by employing various heuristic methods to prune the search space, and select the rules based on the sequential database covering paradigm. As a result, the nal set of rules that they use may not be the globally best rules for some instances in the training database. To make matters worse, these algorithms fail to fully exploit some more eectiv e search space pruning methods in order to scale to large databases. In this paper we present a new classier, HARMONY, which directly mines the nal set of classication rules. HARMONY uses an instance-centric rule-generation approach and it can assure for each training instance, one of the highest-condence rules covering this instance is included in the nal rule set, which helps in improving the overall accuracy of the classier. By introducing several novel search strategies and pruning methods into the rule discovery process, HARMONY also has high eciency and good scalability. Our thorough performance study with some large text and categorical databases has shown that HARMONY outperforms many well-known classiers in terms of both accuracy and computational eciency , and scales well w.r.t. the database size.