Predictability-based collective class association rule mining

Citations

WEB OF SCIENCE

36
Citations

SCOPUS

43

초록

Associative classification is rule-based involving candidate rules as criteria of classification that provide both highly accurate and easily interpretable results to decision makers. The important phase of associative classification is rule evaluation consisting of rule ranking and pruning, in which bad rules are removed to improve performance. Existing association rule mining algorithms relied on frequency-based rule evaluation methods such as support and confidence, failing to provide sound statistical or computational measures for rule evaluation, and often suffer from many redundant rules. In this research we propose predictability-based collective class association rule mining based on cross-validation with a new rule evaluation step. We measure the prediction accuracy of each candidate rule in inner cross-validation steps. We split a training dataset into inner training sets and inner test sets and then evaluate candidate rules' predictive performance. From several experiments, we show that the proposed algorithm outperforms some existing algorithms while maintaining a large number of useful rules in the classifier. Furthermore, by applying the proposed algorithm to a real-life healthcare dataset, we demonstrate that it is practical and has potential to reveal important patterns in the dataset.

키워드

Associative classificationClass association rulesRule rankingRule pruningData miningCLASSIFICATIONALGORITHMS
제목
Predictability-based collective class association rule mining
저자
Song, KiburmLee, Ki chun
DOI
10.1016/j.eswa.2017.02.024
발행일
2017-08
유형
Article
저널명
Expert Systems with Applications
79
페이지
1 ~ 7