提出了一种简化由先验算法产生的关联规则集的方法

Diego de Macedo Rodrigues, Marcelo Lisboa Rocha, Daniela Trevisan, D. Prata, M. A. Silva
{"title":"提出了一种简化由先验算法产生的关联规则集的方法","authors":"Diego de Macedo Rodrigues, Marcelo Lisboa Rocha, Daniela Trevisan, D. Prata, M. A. Silva","doi":"10.18605/2175-7275/cereus.v11n3p158-177","DOIUrl":null,"url":null,"abstract":"The use of association rules algorithms within data mining is recognized as being of great value in the search for knowledge about databases. Very often the number of rules generated is high, sometimes even in databases with small volume, so the success in the analysis of results can be hampered by this quantitative. The purpose of this research is to present a method for reducing the quantitative of rules generated with association algorithms. For this, a computational algorithm was developed with the use of a Weka API, which allows the execution of the method on different types of databases. After the development, tests were carried out on three types of databases: synthetic, model and real. Efficient results were obtained in reducing the number of rules, where the worst case presented a gain of more than 50%, considering the concepts of support, confidence and lift as measures. This study concluded that the proposed model is feasible and quite interesting, contributing to the analysis of the results of association rules generated from the use of algorithms.","PeriodicalId":208128,"journal":{"name":"Revista Cereus","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Proposta de Método para Redução do Conjunto de Regras de Associação Resultantes do Algoritmo Apriori\",\"authors\":\"Diego de Macedo Rodrigues, Marcelo Lisboa Rocha, Daniela Trevisan, D. Prata, M. A. Silva\",\"doi\":\"10.18605/2175-7275/cereus.v11n3p158-177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The use of association rules algorithms within data mining is recognized as being of great value in the search for knowledge about databases. Very often the number of rules generated is high, sometimes even in databases with small volume, so the success in the analysis of results can be hampered by this quantitative. The purpose of this research is to present a method for reducing the quantitative of rules generated with association algorithms. For this, a computational algorithm was developed with the use of a Weka API, which allows the execution of the method on different types of databases. After the development, tests were carried out on three types of databases: synthetic, model and real. Efficient results were obtained in reducing the number of rules, where the worst case presented a gain of more than 50%, considering the concepts of support, confidence and lift as measures. This study concluded that the proposed model is feasible and quite interesting, contributing to the analysis of the results of association rules generated from the use of algorithms.\",\"PeriodicalId\":208128,\"journal\":{\"name\":\"Revista Cereus\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista Cereus\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18605/2175-7275/cereus.v11n3p158-177\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Revista Cereus","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18605/2175-7275/cereus.v11n3p158-177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在数据挖掘中使用关联规则算法被认为在搜索数据库知识方面具有重要价值。通常生成的规则数量非常多,有时甚至在容量很小的数据库中也是如此,因此对结果的成功分析可能会受到这种定量的阻碍。本研究的目的是提出一种减少关联算法生成的规则数量的方法。为此,使用Weka API开发了一种计算算法,该算法允许在不同类型的数据库上执行该方法。开发完成后,分别对合成数据库、模型数据库和真实数据库进行了测试。在减少规则数量方面获得了有效的结果,考虑到支持,信心和提升的概念作为度量,最坏情况的增益超过50%。本研究的结论是,所提出的模型是可行的,并且非常有趣,有助于分析使用算法生成的关联规则的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Proposta de Método para Redução do Conjunto de Regras de Associação Resultantes do Algoritmo Apriori
The use of association rules algorithms within data mining is recognized as being of great value in the search for knowledge about databases. Very often the number of rules generated is high, sometimes even in databases with small volume, so the success in the analysis of results can be hampered by this quantitative. The purpose of this research is to present a method for reducing the quantitative of rules generated with association algorithms. For this, a computational algorithm was developed with the use of a Weka API, which allows the execution of the method on different types of databases. After the development, tests were carried out on three types of databases: synthetic, model and real. Efficient results were obtained in reducing the number of rules, where the worst case presented a gain of more than 50%, considering the concepts of support, confidence and lift as measures. This study concluded that the proposed model is feasible and quite interesting, contributing to the analysis of the results of association rules generated from the use of algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信