MiRABIT:一种新的关联规则挖掘算法

12th International Conference of the Chilean Computer Science Society, 2002. Proceedings. Pub Date : 1900-01-01 DOI:10.1109/SCCC.2002.1173189

S. da Silva Camargo, P. Martins Engel

{"title":"MiRABIT:一种新的关联规则挖掘算法","authors":"S. da Silva Camargo, P. Martins Engel","doi":"10.1109/SCCC.2002.1173189","DOIUrl":null,"url":null,"abstract":"Mining a sales transaction database is a very expensive task in terms of the processing time. Depending on the business branch of the company some characteristics of the database are different. The algorithms currently used for mining association rules optimize this task for databases with supermarket characteristics. The MiRABIT algorithm that is presented in this work optimizes the mining task for databases with clothing store characteristics. Comparative tests demonstrate the efficiency of the proposed algorithm in relation to the standard algorithm Apriori in a clothing store database.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"MiRABIT: A new algorithm for mining association rules\",\"authors\":\"S. da Silva Camargo, P. Martins Engel\",\"doi\":\"10.1109/SCCC.2002.1173189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining a sales transaction database is a very expensive task in terms of the processing time. Depending on the business branch of the company some characteristics of the database are different. The algorithms currently used for mining association rules optimize this task for databases with supermarket characteristics. The MiRABIT algorithm that is presented in this work optimizes the mining task for databases with clothing store characteristics. Comparative tests demonstrate the efficiency of the proposed algorithm in relation to the standard algorithm Apriori in a clothing store database.\",\"PeriodicalId\":130951,\"journal\":{\"name\":\"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.\",\"volume\":\"150 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2002.1173189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2002.1173189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

就处理时间而言，挖掘销售事务数据库是一项非常昂贵的任务。根据公司的业务分支不同，数据库的一些特点也不同。目前用于挖掘关联规则的算法针对具有超市特征的数据库优化了该任务。本文提出的MiRABIT算法优化了具有服装店特征的数据库的挖掘任务。对比实验证明了该算法与标准算法Apriori在服装商店数据库中的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

MiRABIT: A new algorithm for mining association rules

Mining a sales transaction database is a very expensive task in terms of the processing time. Depending on the business branch of the company some characteristics of the database are different. The algorithms currently used for mining association rules optimize this task for databases with supermarket characteristics. The MiRABIT algorithm that is presented in this work optimizes the mining task for databases with clothing store characteristics. Comparative tests demonstrate the efficiency of the proposed algorithm in relation to the standard algorithm Apriori in a clothing store database.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.

自引率

0.00%

发文量