Information-Based Rule Ranking for Associative Classification

H. Ong, Cheryl Yi Ming Neoh, Vhera Kaey Vijayaraj, Yi Xian Low
{"title":"Information-Based Rule Ranking for Associative Classification","authors":"H. Ong, Cheryl Yi Ming Neoh, Vhera Kaey Vijayaraj, Yi Xian Low","doi":"10.1109/ISPACS57703.2022.10082812","DOIUrl":null,"url":null,"abstract":"Classification rule mining is a promising approach in data mining to create more interpretable and accurate prediction systems. This approach typically builds on top of well-known association rule mining and classification techniques, which identify a subset of rules known as class association rules (CAR), whose consequents are limited to target class labels. Existing classification rule mining methods have proven to provide better predictive accuracy while improving the interpretability and reasoning of a problem. Nevertheless, the challenges of such methods are mainly on a large number of generated CAR and the ranking and selection of interesting CAR for building classifiers. This paper proposed a hybrid of association rule mining (FP-growth) and neural network (sequential network of dense layers) techniques, focusing on using an information-based approach to rank and select interesting CAR. Preliminary experiments were conducted on nine UCI Machine Learning Repository datasets to examine the effect of the proposed hybrid model on generic datasets. The results show that the proposed approach achieved higher accuracy than other associative classification methods.","PeriodicalId":410603,"journal":{"name":"2022 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS57703.2022.10082812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Classification rule mining is a promising approach in data mining to create more interpretable and accurate prediction systems. This approach typically builds on top of well-known association rule mining and classification techniques, which identify a subset of rules known as class association rules (CAR), whose consequents are limited to target class labels. Existing classification rule mining methods have proven to provide better predictive accuracy while improving the interpretability and reasoning of a problem. Nevertheless, the challenges of such methods are mainly on a large number of generated CAR and the ranking and selection of interesting CAR for building classifiers. This paper proposed a hybrid of association rule mining (FP-growth) and neural network (sequential network of dense layers) techniques, focusing on using an information-based approach to rank and select interesting CAR. Preliminary experiments were conducted on nine UCI Machine Learning Repository datasets to examine the effect of the proposed hybrid model on generic datasets. The results show that the proposed approach achieved higher accuracy than other associative classification methods.
基于信息的关联分类规则排序
分类规则挖掘是一种很有前途的数据挖掘方法,可以创建更可解释和更准确的预测系统。这种方法通常建立在众所周知的关联规则挖掘和分类技术的基础上,这些技术识别被称为类关联规则(CAR)的规则子集,其结果仅限于目标类标签。现有的分类规则挖掘方法已被证明在提高问题的可解释性和推理性的同时提供了更好的预测准确性。然而,这些方法的挑战主要在于大量生成的CAR和对感兴趣的CAR进行排序和选择以构建分类器。本文提出了一种关联规则挖掘(FP-growth)和神经网络(密集层序列网络)技术的混合技术,重点是使用基于信息的方法对感兴趣的CAR进行排序和选择。在9个UCI机器学习存储库数据集上进行了初步实验,以检验所提出的混合模型对通用数据集的影响。结果表明,该方法比其他关联分类方法具有更高的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信