Classification of association rules based on K-means algorithm

A. Dahbi, Mohammed Mouhir, Y. Balouki, T. Gadi
{"title":"Classification of association rules based on K-means algorithm","authors":"A. Dahbi, Mohammed Mouhir, Y. Balouki, T. Gadi","doi":"10.1109/CIST.2016.7805061","DOIUrl":null,"url":null,"abstract":"Association rule mining is one of the most relevant techniques in data mining, aiming to extract correlation among sets of items or products in transactional databases. The huge number of association rules extracted represents the main obstacle that a decision maker faces. Hence, many interestingness measures have been proposed to evaluate the association rules. However, the abundance of these measures caused a new problem, which is the selection of measures that is best suited to the users. To bypass this problem, we propose an approach based on K-means algorithm to classify and to store Association Rules without favoring or excluding any measures. The experiments, performed on numerous datasets, show a significant performance of the proposed approach and it effectively classify the association rules.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"87 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIST.2016.7805061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Association rule mining is one of the most relevant techniques in data mining, aiming to extract correlation among sets of items or products in transactional databases. The huge number of association rules extracted represents the main obstacle that a decision maker faces. Hence, many interestingness measures have been proposed to evaluate the association rules. However, the abundance of these measures caused a new problem, which is the selection of measures that is best suited to the users. To bypass this problem, we propose an approach based on K-means algorithm to classify and to store Association Rules without favoring or excluding any measures. The experiments, performed on numerous datasets, show a significant performance of the proposed approach and it effectively classify the association rules.
基于K-means算法的关联规则分类
关联规则挖掘是数据挖掘中最相关的技术之一,旨在提取事务数据库中项目或产品集之间的相关性。提取的大量关联规则是决策者面临的主要障碍。因此,人们提出了许多有趣度度量来评估关联规则。然而,这些措施的丰富带来了一个新问题,即选择最适合用户的措施。为了绕过这个问题,我们提出了一种基于K-means算法的方法来对关联规则进行分类和存储,而不偏袒或排除任何度量。在大量数据集上进行的实验表明,该方法具有显著的性能,并能有效地对关联规则进行分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信