四月式算法的实现,在edukititbtc产品购买模式建模中

Kevin Ellvan Reisyer, Rika Harman
{"title":"四月式算法的实现,在edukititbtc产品购买模式建模中","authors":"Kevin Ellvan Reisyer, Rika Harman","doi":"10.33884/comasiejournal.v9i3.7656","DOIUrl":null,"url":null,"abstract":"In competition in the business world, especially the retail industry, requires developers to find an appropriate strategy in order to increase sales of school equipment, one way is to know the sales pattern of school equipment so that we can apply the right steps to provide more facilities, in order to increase selling power. A priori algorithm is a type of association rule in data mining. A priori is a very famous algorithm for finding high frequency patterns. A high frequency pattern is an item pattern in the database that has frequency or support above a certain threshold which is called the minimum support term. Using an a priori algorithm can help develop a marketing strategy. The results showed that with a minimum support of 30%, there were 4 combination patterns of one item set that achieved minimum support, with the highest support for Stationery Office of 72.6%, for a combination of 2 itemsets there were 4 combination patterns with the highest support (School Stationery, Stationery Office) namely 54.8%, for a combination of 3 itemsets there was 1 combination pattern with the highest support (Art & Craft, School Stationery, Office Stationery) namely 32.9%.","PeriodicalId":500489,"journal":{"name":"Computer and Science Industrial Engineering (COMASIE)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"IMPLEMENTASI ALGORITMA APRIORI DALAM PEMODELAN POLA PEMBELIAN PRODUK PADA EDUKITS BTC\",\"authors\":\"Kevin Ellvan Reisyer, Rika Harman\",\"doi\":\"10.33884/comasiejournal.v9i3.7656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In competition in the business world, especially the retail industry, requires developers to find an appropriate strategy in order to increase sales of school equipment, one way is to know the sales pattern of school equipment so that we can apply the right steps to provide more facilities, in order to increase selling power. A priori algorithm is a type of association rule in data mining. A priori is a very famous algorithm for finding high frequency patterns. A high frequency pattern is an item pattern in the database that has frequency or support above a certain threshold which is called the minimum support term. Using an a priori algorithm can help develop a marketing strategy. The results showed that with a minimum support of 30%, there were 4 combination patterns of one item set that achieved minimum support, with the highest support for Stationery Office of 72.6%, for a combination of 2 itemsets there were 4 combination patterns with the highest support (School Stationery, Stationery Office) namely 54.8%, for a combination of 3 itemsets there was 1 combination pattern with the highest support (Art & Craft, School Stationery, Office Stationery) namely 32.9%.\",\"PeriodicalId\":500489,\"journal\":{\"name\":\"Computer and Science Industrial Engineering (COMASIE)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer and Science Industrial Engineering (COMASIE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33884/comasiejournal.v9i3.7656\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer and Science Industrial Engineering (COMASIE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33884/comasiejournal.v9i3.7656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在商业世界的竞争中,尤其是零售行业,要求开发商找到一个合适的策略来增加学校设备的销售,其中一个方法是了解学校设备的销售模式,这样我们就可以应用正确的步骤来提供更多的设施,以增加销售能力。先验算法是数据挖掘中的一种关联规则。先验算法是一种非常有名的用于发现高频模式的算法。高频模式是数据库中频率或支持度高于一定阈值的项目模式,该阈值称为最小支持项。使用先验算法可以帮助制定营销策略。结果表明,在最低支持度为30%的情况下,一个项目集有4种组合模式达到最低支持度,其中文具办公室的支持度最高为72.6%,2个项目集的组合有4种组合模式(学校文具、文具办公室)的支持度最高为54.8%,3个项目集的组合有1种组合模式的支持度最高(艺术&工艺品、学校文具、办公文具)占32.9%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
IMPLEMENTASI ALGORITMA APRIORI DALAM PEMODELAN POLA PEMBELIAN PRODUK PADA EDUKITS BTC
In competition in the business world, especially the retail industry, requires developers to find an appropriate strategy in order to increase sales of school equipment, one way is to know the sales pattern of school equipment so that we can apply the right steps to provide more facilities, in order to increase selling power. A priori algorithm is a type of association rule in data mining. A priori is a very famous algorithm for finding high frequency patterns. A high frequency pattern is an item pattern in the database that has frequency or support above a certain threshold which is called the minimum support term. Using an a priori algorithm can help develop a marketing strategy. The results showed that with a minimum support of 30%, there were 4 combination patterns of one item set that achieved minimum support, with the highest support for Stationery Office of 72.6%, for a combination of 2 itemsets there were 4 combination patterns with the highest support (School Stationery, Stationery Office) namely 54.8%, for a combination of 3 itemsets there was 1 combination pattern with the highest support (Art & Craft, School Stationery, Office Stationery) namely 32.9%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信