Assortment planning using data mining algorithms

A.N. Gun, B. Badur
{"title":"Assortment planning using data mining algorithms","authors":"A.N. Gun, B. Badur","doi":"10.1109/PICMET.2008.4599855","DOIUrl":null,"url":null,"abstract":"Assortment optimization is not just selecting the best products according to the sales performance under a certain category, but also an execution method to apply retailers commercial strategy into market considering all strategies which retailer want to play. Regarding millions of data saved in databases and explosive growth of data leads to a situation in which it is increasingly difficult for retailers to understand the right information. To cope with this problem we are planning to use association algorithms to put in place data mining in product selection. It should also be considered that selecting best and suitable products for assortment of retailer need not only sophisticated algorithms to take decisions but also business perspective to embed into decision system. In this study, we approach the assortment selection problem, by improving the PROFSET model and GENERALIZED PROFSET model, which is based on a microeconomic framework. We improved the basic model by introducing additional method of profit allocation over frequent item sets, constraints about categories and sold quantities. Finally we empirically test our model with sample retailer data. While doing this we will also take into consideration the retail industry characteristics and consumer and customer perceptions.","PeriodicalId":168329,"journal":{"name":"PICMET '08 - 2008 Portland International Conference on Management of Engineering & Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PICMET '08 - 2008 Portland International Conference on Management of Engineering & Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICMET.2008.4599855","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Assortment optimization is not just selecting the best products according to the sales performance under a certain category, but also an execution method to apply retailers commercial strategy into market considering all strategies which retailer want to play. Regarding millions of data saved in databases and explosive growth of data leads to a situation in which it is increasingly difficult for retailers to understand the right information. To cope with this problem we are planning to use association algorithms to put in place data mining in product selection. It should also be considered that selecting best and suitable products for assortment of retailer need not only sophisticated algorithms to take decisions but also business perspective to embed into decision system. In this study, we approach the assortment selection problem, by improving the PROFSET model and GENERALIZED PROFSET model, which is based on a microeconomic framework. We improved the basic model by introducing additional method of profit allocation over frequent item sets, constraints about categories and sold quantities. Finally we empirically test our model with sample retailer data. While doing this we will also take into consideration the retail industry characteristics and consumer and customer perceptions.
利用数据挖掘算法进行分类规划
分类优化不仅仅是根据某一品类的销售业绩选择出最优的产品,而是考虑到零售商想要采取的所有策略,将零售商的商业策略应用于市场的一种执行方法。数据库中保存了数百万的数据,数据的爆炸式增长导致零售商越来越难以理解正确的信息。为了解决这个问题,我们计划使用关联算法在产品选择中进行数据挖掘。为零售商选择最合适的产品不仅需要复杂的算法来进行决策,还需要将商业视角嵌入决策系统。本文通过改进PROFSET模型和基于微观经济学框架的广义PROFSET模型来研究分类选择问题。我们通过引入额外的利润分配方法对基本模型进行了改进,包括对频繁项目集、类别约束和销售数量的分配。最后用零售商样本数据对模型进行了实证检验。在此过程中,我们也会考虑到零售业的特点以及消费者和顾客的看法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信