Article

Free access

Using association rules for product assortment decisions: a case study

Authors:

Tom Brijs,

Gilbert Swinnen,

Koen Vanhoof,

Geert WetsAuthors Info & Claims

KDD '99: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining

Pages 254 - 260

https://doi.org/10.1145/312129.312241

Published: 01 August 1999 Publication History

PDF eReader

References

[1]

Agrawal, R., Imielinski, T., and Swami, A. Mining association rules between sets of items in large databases. In Buneman, P., and Jajodia, S., (eds.). Proceedings of ACM SIGMOD Conference on Management of Data, 1993 (SIGMOD93), 207-216.

Digital Library

Google Scholar

[2]

Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A. Fast discovery of association rules. In Fayyad, U., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R., (eds.). Advances in Knowledge Discovery and Data Mining: AAAI Press, 1996, 307-328.

Digital Library

Google Scholar

[3]

Agrawal, R., and Srikant, R. Fast algorithms for mining association rules. In Bocca, J., Jarke, M., Zaniolo, C., (eds.). Proceedings of the 20th International Conference on Very Large Databases, 1994 (VLDB'94), 487-499.

Digital Library

Google Scholar

[4]

All, K., Manganaris, S., and Srikant, R. Partial classification using association rules. In Heckerman, D., Mannila, H., Pregibon, D., and Uthurusamy, R. (eds.). Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, 1997 (KDD97), 115-118.

Google Scholar

[5]

Anand, S., Hughes, J., Bell, D., and Patrick, A. Tackling the cross-sales problem using data mining. In Lu, H., Motoda, H., and Liu, H. (eds.). Proceedings of the First Pacific-Asia Conference on Knowledge Discovery and Data Mining, 1997 (PAKDD'97), 331-343.

Google Scholar

[6]

Anderson, E. An analysis of retail display space: theory and methods. In Journal of Business, 52, 103-118, 1979.

Crossref

Google Scholar

[7]

Blischok, T. Every transaction tells a story. In Chain Store Age Executive with Shopping Center Age, 71 (3), 50-57, 1995.

Google Scholar

[8]

Borin, N., and Farris, P. A sensitivity analysis of retailer shelf management models. In Journal of Retailing, 71, 153-171, 1995.

Crossref

Google Scholar

[9]

Brin, S., Motwani, R., and Silverstein, C. Beyond market baskets: generalizing association rules to correlations. In Peckham, J., (ed.). Proceedings of the ACM SIGMOD Conference on Management of Data, 1997 (SIGMOD97), 265-276.

Digital Library

Google Scholar

[10]

Brin, S., Motwani, R., Ullman, J., and Tsur, S. Dynamic itemset counting and implication rules for market basket data. In Peckham, J. (ed.). Proceedings ACM SIGMOD International Conference on Management of Data, 1997 (SiGMOD97), 255-264.

Digital Library

Google Scholar

[11]

Brown, W., and Tucker W. The marketing center; vanishing shelf space, Atlanta Econ. Rev., 9-13, 1961.

Google Scholar

[12]

Bultez, A., and Naert, P. S.H.A.R.P.: shelf allocation for retailers' profit. In Marketing Science, 7, 211-231, 1988.

Digital Library

Google Scholar

[13]

Bultez, A., Gijsbrechts, E., Naert, P., and Vanden Abeele, P. Asymmetric cannibalism in retail assortments. In Journal of Retailing, 65(2), 153-192, 1989.

Google Scholar

[14]

Corstjens, M., and Doyle, P. A model for optimizing retail space allocations. In Management Science, 27, 822-833, 1981.

Digital Library

Google Scholar

[15]

Corstjens, M., and Doyle, P. A dynamic model for strategically allocating retail space. In Journal of the Operational Research Society, 34, 943-951, 1983.

Crossref

Google Scholar

[16]

Hansen, P., and Heinsbroek, H. Product selection and space allocation in supermarkets. In European Journal of Operational Research, 3, 474-484, 1978.

Crossref

Google Scholar

[17]

Hedberg, S. The data gold rush, BYTE, October 1995, 83- 88.

Google Scholar

[18]

Kleinberg, J., Papadimitriou, C., and Raghavan, P. A microeconomic view of data mining. Data Mining and Knowledge Discovery Journal, 2 (4), 311-324, 1998.

Digital Library

Google Scholar

[19]

Mannila, H. Methods and problems in data mining. In Afrati, F., and Kolaitis, P. (eds.). Proceedings of the International Conference on Database Theory, 41-55, 1997.

Digital Library

Google Scholar

[20]

McGoldrick, P. Retail Marketing, McGraw-Hill, 362p, 1990.

Google Scholar

[21]

Park, J., Chen, M., and Yu, Ph. An effective hash based algorithm for mining association rules. In Carey, M., Schneider, D. (eds.). Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 175-186.

Digital Library

Google Scholar

[22]

Pessemier, E. Retail assortments- some theoretical and applied problems, Technical Report, Marketing Science Institute Research Program, 77p., 1980.

Google Scholar

[23]

Urban, T. An inventory-theoretic approach to product assortment and shelf-space allocation. In Journal of Retailing, 74, 15-35, 1998.

Crossref

Google Scholar

[24]

Van der Ster, W., and van Wissen, P. Marketing & detailhandel, Wolters-Noordhoff, 459 p., 1993.

Google Scholar

[25]

Viveros, M., Nearhos, J., and Rothman, M. Applying data mining techniques to a health insurance information system. In Vijayaraman, T., Buchmann, A., Mohan, C., Sarda, N. (eds.). Proceedings of the 22nd International Conference on Very Large Data Bases, 1996 (VLDB'96), 286-294.

Digital Library

Google Scholar

[26]

Zaki, M., Parthasarathy, S., Ogihara, M., and Li, M. New algorithms for fast discovery of association rules. In Heckerman, D., Mannila, H., Pregibon, D., and Uthurusamy, R. (eds.). Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, 1997 (KDD97), 283-286.

Google Scholar

[27]

Zufryden, F. A dynamic programming approach for product selection and supermarket shelf-space allocation. In Journal of the Operational Research Society, 37, 413- 422, 1986.

Crossref

Google Scholar

[28]

Zufryden, F. New computational results with a dynamic programming approach for product selection and supermarket shelf-space allocation. In Journal of the Operational Research Society, 38, 201-203, 1987.

Crossref

Google Scholar

Cited By

View all

Jenkins PSelander MJenkins JMerrill AArmstrong KBaeza-Yates RBonchi F(2024)Personalized Product Assortment with Real-time 3D Perception and Bayesian Payoff EstimationProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671518(5161-5171)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671518
Shahin MBurtl MIman MGhasempouri TSharma RShah SDraheim D(2024)Significant Factors Extraction: A Combined Logistic Regression and Apriori Association Rule Mining ApproachMachine Learning Methods in Systems10.1007/978-3-031-70595-3_30(295-311)Online publication date: 24-Oct-2024
https://doi.org/10.1007/978-3-031-70595-3_30
Yi MZhang R(2023)Modeling and Solving the Joint Replenishment Problem with Cross-Selling Effects Considering One Shared Minor ItemSystems10.3390/systems1201000612:1(6)Online publication date: 22-Dec-2023
https://doi.org/10.3390/systems12010006
Show More Cited By

Index Terms

Using association rules for product assortment decisions: a case study

Recommendations

Building an Association Rules Framework to Improve Product Assortment Decisions

It has been claimed that the discovery of association rules is well suited for applications of market basket analysis to reveal regularities in the purchase behaviour of customers. However today, one disadvantage of associations discovery is that there ...
An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices

Multilevel knowledge in transactional databases plays a significant role in our real-life market basket analysis. Many researchers have mined the hierarchical association rules and thus proposed various approaches. However, some of the existing ...
Mining Negatives Association Rules Using Constraints

Pattern discovery techniques, such as association rule discovery is one of the fundamental problem in data mining. Usually the task is limited to positive rules of the form X Y when X and Y are susbets of items. To enlarge the knowledge discovery from ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

KDD '99: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining

August 1999

439 pages

ISBN:1581131437

DOI:10.1145/312129

Chairmen:
Usama Fayyad
Microsoft Research
,
Surajit Chaudhuri
Microsoft Research
,
David Madigan
AT&T Labs-Research

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

KDD99

Sponsor:

KDD99: The First Annual International Conference on Knowledge Discovery in Data

August 15 - 18, 1999

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

259
Total Citations
View Citations
3,627
Total Downloads

Downloads (Last 12 months)332
Downloads (Last 6 weeks)39

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jenkins PSelander MJenkins JMerrill AArmstrong KBaeza-Yates RBonchi F(2024)Personalized Product Assortment with Real-time 3D Perception and Bayesian Payoff EstimationProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671518(5161-5171)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671518
Shahin MBurtl MIman MGhasempouri TSharma RShah SDraheim D(2024)Significant Factors Extraction: A Combined Logistic Regression and Apriori Association Rule Mining ApproachMachine Learning Methods in Systems10.1007/978-3-031-70595-3_30(295-311)Online publication date: 24-Oct-2024
https://doi.org/10.1007/978-3-031-70595-3_30
Yi MZhang R(2023)Modeling and Solving the Joint Replenishment Problem with Cross-Selling Effects Considering One Shared Minor ItemSystems10.3390/systems1201000612:1(6)Online publication date: 22-Dec-2023
https://doi.org/10.3390/systems12010006
Ebrahim A(2023)Finding the Top-K Heavy Hitters in Data Streams: A Reconfigurable Accelerator Based on an FPGA-Optimized AlgorithmElectronics10.3390/electronics1211237612:11(2376)Online publication date: 24-May-2023
https://doi.org/10.3390/electronics12112376
Zhao ZLan LWang BLai J(2023)Verifiable Privacy-Preserving Outsourced Frequent Itemset Mining on Vertically Partitioned DatabasesElectronics10.3390/electronics1208195212:8(1952)Online publication date: 21-Apr-2023
https://doi.org/10.3390/electronics12081952
Zheng PCheng ZTian XLiu HLuo WHuang J(2023)Non-Interactive Privacy-Preserving Frequent Itemset Mining Over Encrypted Cloud DataIEEE Transactions on Cloud Computing10.1109/TCC.2023.329137811:4(3452-3468)Online publication date: Oct-2023
https://doi.org/10.1109/TCC.2023.3291378
Ebrahim AKhalifat J(2023)Fast approximation of the top‐k items in data streams using FPGAsIET Computers & Digital Techniques10.1049/cdt2.1205317:2(60-73)Online publication date: 19-Feb-2023
https://doi.org/10.1049/cdt2.12053
Edirisinghe GMunson C(2023)Strategic rearrangement of retail shelf space allocations: Using data insights to encourage impulse buyingExpert Systems with Applications10.1016/j.eswa.2022.119442216(119442)Online publication date: Apr-2023
https://doi.org/10.1016/j.eswa.2022.119442
Ansar SArya SDwivedi SSoni NYadav APathak P(2023)Data Mining: An Incipient Approach to World SecurityComputer Vision and Robotics10.1007/978-981-19-7892-0_43(541-550)Online publication date: 28-Apr-2023
https://doi.org/10.1007/978-981-19-7892-0_43
Agarwal R(2022)Ordering Policy Estimation for High Utility Item-Sets Considering Negative Item Values in Large DatabasesInternational Journal of Decision Support System Technology10.4018/IJDSST.28668214:1(1-16)Online publication date: 1-Jan-2022
https://doi.org/10.4018/IJDSST.286682
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Building an Association Rules Framework to Improve Product Assortment Decisions

An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices

Mining Negatives Association Rules Using Constraints