Archives and Documentation Center
Digital Archives

Assortment planning using data mining algorithms

Show simple item record

dc.contributor Graduate Program in Management Information Systems.
dc.contributor.advisor Badur, Bertan Yılmaz.
dc.contributor.author Gün, Ajlan Nihat.
dc.date.accessioned 2023-03-16T12:51:38Z
dc.date.available 2023-03-16T12:51:38Z
dc.date.issued 2008.
dc.identifier.other MIS 2008 G86
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/18129
dc.description.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 algortihms 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.
dc.format.extent 30cm.
dc.publisher Thesis (M.A.)-Bogazici University. Institute for Graduate Studies in the Social Sciences, 2008.
dc.subject.lcsh Data mining.
dc.subject.lcsh Computer algorithms.
dc.title Assortment planning using data mining algorithms
dc.format.pages x, 45 leaves;


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Digital Archive


Browse

My Account