Predictability-based collective class association rule mining
- Authors
- Song, Kiburm; Lee, Ki chun
- Issue Date
- Aug-2017
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Keywords
- Associative classification; Class association rules; Rule ranking; Rule pruning; Data mining
- Citation
- EXPERT SYSTEMS WITH APPLICATIONS, v.79, pp.1 - 7
- Indexed
- SCIE
SCOPUS
- Journal Title
- EXPERT SYSTEMS WITH APPLICATIONS
- Volume
- 79
- Start Page
- 1
- End Page
- 7
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/151896
- DOI
- 10.1016/j.eswa.2017.02.024
- ISSN
- 0957-4174
- Abstract
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.