利用机器学习确定关联规则的上下文

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Kanwal Nisar, Muhammad Shaheen
{"title":"利用机器学习确定关联规则的上下文","authors":"Kanwal Nisar, Muhammad Shaheen","doi":"10.1080/0952813X.2021.1955980","DOIUrl":null,"url":null,"abstract":"ABSTRACT Association rule mining is typically used to uncover the enthralling interdependencies between the set of variables and reveals the hidden pattern within the dataset. The associations are identified based on co-occurring variables with high frequencies. These associations can be positive (A→B) or negative (A→⌐B). The number of these association rules in larger databases are considerably higher which restricted the extraction of valuable insights from the dataset. Some rule pruning strategies are used to reduce the number of rules that can sometimes miss an important, or include an unimportant rule into the final rule set because of not considering the context of the rule. Context-based positive and negative association rule mining (CBPNARM) for the first time included context variable in the algorithms of association rule mining for selection/ de-selection of such rules. In CBPNARM, the selection of context variable and its range of values are done by the user/expert of the system which demands unwanted user interaction and may add some bias to the results. This paper proposes a method to automate the selection of context variable and selection of its value range. The context variable is chosen by using the diversity index and chi-square test, and the range of values for the context variable is set by using box plot analysis. The proposed method on top of it added conditional-probability increment ratio (CPIR) for further pruning uninteresting rules. Experiments show the system can select the context variable automatically and set the right range for the selected context variable. The performance of the proposed method is compared with CBPNARM and other state of the art methods.","PeriodicalId":15677,"journal":{"name":"Journal of Experimental & Theoretical Artificial Intelligence","volume":"6 3 Pt 1 1","pages":"59 - 76"},"PeriodicalIF":1.7000,"publicationDate":"2021-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Determining context of association rules by using machine learning\",\"authors\":\"Kanwal Nisar, Muhammad Shaheen\",\"doi\":\"10.1080/0952813X.2021.1955980\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Association rule mining is typically used to uncover the enthralling interdependencies between the set of variables and reveals the hidden pattern within the dataset. The associations are identified based on co-occurring variables with high frequencies. These associations can be positive (A→B) or negative (A→⌐B). The number of these association rules in larger databases are considerably higher which restricted the extraction of valuable insights from the dataset. Some rule pruning strategies are used to reduce the number of rules that can sometimes miss an important, or include an unimportant rule into the final rule set because of not considering the context of the rule. Context-based positive and negative association rule mining (CBPNARM) for the first time included context variable in the algorithms of association rule mining for selection/ de-selection of such rules. In CBPNARM, the selection of context variable and its range of values are done by the user/expert of the system which demands unwanted user interaction and may add some bias to the results. This paper proposes a method to automate the selection of context variable and selection of its value range. The context variable is chosen by using the diversity index and chi-square test, and the range of values for the context variable is set by using box plot analysis. The proposed method on top of it added conditional-probability increment ratio (CPIR) for further pruning uninteresting rules. Experiments show the system can select the context variable automatically and set the right range for the selected context variable. The performance of the proposed method is compared with CBPNARM and other state of the art methods.\",\"PeriodicalId\":15677,\"journal\":{\"name\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"volume\":\"6 3 Pt 1 1\",\"pages\":\"59 - 76\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2021-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1080/0952813X.2021.1955980\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Experimental & Theoretical Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/0952813X.2021.1955980","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

关联规则挖掘通常用于揭示变量集之间引人入胜的相互依赖关系,并揭示数据集中隐藏的模式。这些关联是基于高频共存变量来确定的。这些关联可以是正的(A→B)或负的(A→__ B)。在大型数据库中,这些关联规则的数量相当多,这限制了从数据集中提取有价值的见解。一些规则修剪策略用于减少有时会因为没有考虑规则的上下文而错过重要规则或将不重要规则包含到最终规则集中的规则数量。基于上下文的正、负关联规则挖掘(CBPNARM)首次在关联规则挖掘算法中加入上下文变量,实现对正、负关联规则的选择和去选择。在CBPNARM中,上下文变量及其取值范围的选择由系统的用户/专家完成,这需要不必要的用户交互,并且可能会给结果增加一些偏差。本文提出了一种自动选择上下文变量及其取值范围的方法。使用多样性指数和卡方检验选择上下文变量,使用箱形图分析设置上下文变量的取值范围。该方法在此基础上增加了条件概率增量比(CPIR)来进一步修剪无兴趣规则。实验表明,该系统可以自动选择上下文变量,并为所选上下文变量设置合适的范围。将该方法的性能与CBPNARM和其他最先进的方法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Determining context of association rules by using machine learning
ABSTRACT Association rule mining is typically used to uncover the enthralling interdependencies between the set of variables and reveals the hidden pattern within the dataset. The associations are identified based on co-occurring variables with high frequencies. These associations can be positive (A→B) or negative (A→⌐B). The number of these association rules in larger databases are considerably higher which restricted the extraction of valuable insights from the dataset. Some rule pruning strategies are used to reduce the number of rules that can sometimes miss an important, or include an unimportant rule into the final rule set because of not considering the context of the rule. Context-based positive and negative association rule mining (CBPNARM) for the first time included context variable in the algorithms of association rule mining for selection/ de-selection of such rules. In CBPNARM, the selection of context variable and its range of values are done by the user/expert of the system which demands unwanted user interaction and may add some bias to the results. This paper proposes a method to automate the selection of context variable and selection of its value range. The context variable is chosen by using the diversity index and chi-square test, and the range of values for the context variable is set by using box plot analysis. The proposed method on top of it added conditional-probability increment ratio (CPIR) for further pruning uninteresting rules. Experiments show the system can select the context variable automatically and set the right range for the selected context variable. The performance of the proposed method is compared with CBPNARM and other state of the art methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.10
自引率
4.50%
发文量
89
审稿时长
>12 weeks
期刊介绍: Journal of Experimental & Theoretical Artificial Intelligence (JETAI) is a world leading journal dedicated to publishing high quality, rigorously reviewed, original papers in artificial intelligence (AI) research. The journal features work in all subfields of AI research and accepts both theoretical and applied research. Topics covered include, but are not limited to, the following: • cognitive science • games • learning • knowledge representation • memory and neural system modelling • perception • problem-solving
×
引用
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学术官方微信