Classification based on association rules: A lattice-based approach

详细信息	查看全文 | 推荐本文 |

• 作者：Loan T.T. Nguyen^a ; ^{nguyenthithuyloan@vov.org.vn} ; Bay Vo^b ; ^{vdbay@itc.edu.vn} ; Tzung-Pei Hong^c ; ^d ; ^{tphong@nuk.edu.tw} ; Hoang Chi Thanh^e ; ^{thanhhc@vnu.vn}
• 关键词：Classifier ; Class association rules ; Data mining ; Lattice ; Rule pruning
• 刊名：Expert Systems with Applications
• 出版年：2012
• 期刊代码：62_09574174
• 类别：et
• 出版时间：1 October, 2012
• 卷：39
• 期：13
• 页码：11357-11366
• 文件大小：585 K

摘要

Classification plays an important role in decision support systems. A lot of methods for mining classification rules have been developed in recent years, such as C4.5 and ILA. These methods are, however, based on heuristics and greedy approaches to generate rule sets that are either too general or too overfitting for a given dataset. They thus often yield high error ratios. Recently, a new method for classification from data mining, called the Classification Based on Associations (CBA), has been proposed for mining class-association rules (CARs). This method has more advantages than the heuristic and greedy methods in that the former could easily remove noise, and the accuracy is thus higher. It can additionally generate a rule set that is more complete than C4.5 and ILA. One of the weaknesses of mining CARs is that it consumes more time than C4.5 and ILA because it has to check its generated rule with the set of the other rules. We thus propose an efficient pruning approach to build a classifier quickly. Firstly, we design a lattice structure and propose an algorithm for fast mining CARs using this lattice. Secondly, we develop some theorems and propose an algorithm for pruning redundant rules quickly based on these theorems. Experimental results also show that the proposed approach is more efficient than those used previously.