A new method for ranking association rules with multiple criteria based on dominance relation

A. Dahbi, S. Jabri, Y. Balouki, T. Gadi
{"title":"A new method for ranking association rules with multiple criteria based on dominance relation","authors":"A. Dahbi, S. Jabri, Y. Balouki, T. Gadi","doi":"10.1109/AICCSA.2016.7945619","DOIUrl":null,"url":null,"abstract":"Datamining is the process of extracting interesting information of patterns from large databases. One of the most important datamining task and well-researched is the association rules mining. It aims to find the interesting correlation and relations among sets of items in the transaction databases. One of the main problems related to the discovery of these associations that a decision maker faces is the huge number of association rules extracted. Various measures propose to evaluate the extracted association rules. Currently there is no optimal measure, and there is no measure is better than others. To solve this challenge we propose an approach based on dominance relation aiming to find a good compromise without favoring or excluding any measures by applying a value to each rule which permit to ranking them. The experiments performed on benchmark datasets, show a significant performance of the proposed approach.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2016.7945619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Datamining is the process of extracting interesting information of patterns from large databases. One of the most important datamining task and well-researched is the association rules mining. It aims to find the interesting correlation and relations among sets of items in the transaction databases. One of the main problems related to the discovery of these associations that a decision maker faces is the huge number of association rules extracted. Various measures propose to evaluate the extracted association rules. Currently there is no optimal measure, and there is no measure is better than others. To solve this challenge we propose an approach based on dominance relation aiming to find a good compromise without favoring or excluding any measures by applying a value to each rule which permit to ranking them. The experiments performed on benchmark datasets, show a significant performance of the proposed approach.
基于优势关系的多准则关联规则排序新方法
数据挖掘是从大型数据库中提取有趣的模式信息的过程。关联规则挖掘是最重要的数据挖掘任务之一。它旨在发现事务数据库中项目集之间有趣的相关性和关系。决策者面临的与发现这些关联相关的主要问题之一是提取的大量关联规则。提出了各种方法来评估提取的关联规则。目前没有最优的措施,也没有比其他措施更好的措施。为了解决这一挑战,我们提出了一种基于优势关系的方法,旨在通过对每个规则应用一个值来对它们进行排序,从而在不偏袒或排除任何措施的情况下找到一个好的折衷方案。在基准数据集上进行的实验表明,该方法具有显著的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信