The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Using association rules for product assortment decisions: a case study
Abstract
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. Moreover, recent work indicates that the discovery of interesting rules can in fact only be addressed within a microeconomic framework. This study integrates the discovery of frequent itemsets with a (microeconomic) model for product selection (PROFSET). The model enables the integration of both quantitative and qualitative (domain knowledge) criteria. Sales transaction data from a fullyautomated convenience store is used to demonstrate the effectiveness of the model against a heuristic for product selection based on product-specific profitability. We show that with the use of frequent itemsets we are able to identify the cross-sales potential of product items and use this information for better product selection. Furthermore, we demonstrate that the impact of product assortment decisions on overall assortment profitability can easily be evaluated by means of sensitivity analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 1×
“While many researchers have significantly contributed to the development of efficient association rule algorithms [1-3, 10, 21, 26], literature on the use of this technique in concrete real-world applications remains rather limited [4, 5, 25].”
BackgroundFast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Proceedings of the 32nd international conference on Very large data bases
Dayal, U., Whang, K.-Y., Lomet, D., Alonso, G., Lohman, G. M., Kersten, M. L., Sang, K., & Kim, Y. (2006) · Medical Entomology and Zoology · Cited by 479
Proceedings of the 20th International Conference on Very Large Data Bases
Bocca, J. B., Jarke, M., & Zaniolo, C. (1994) · Cited by 456
A Model for Optimizing Retail Space Allocations
Corstjens, M., & Doyle, P. (1981) · Management Science · doi:10.1287/mnsc.27.7.822 · Cited by 396
An inventory-theoretic approach to product assortment and shelf-space allocation
Urban, T. L. (1998) · Journal of Retailing · doi:10.1016/s0022-4359(99)80086-4 · Cited by 226
Partial classification using association rules
Ali, K., Manganaris, S., & Srikant, R. (1997) · Cited by 221
A Microeconomic View of Data Mining
Kleinberg, J., Papadimitriou, C., & Raghavan, P. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009726428407 · Cited by 193
Methods and problems in data mining
Mannila, H. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62222-5_35 · Cited by 180
Proceedings of the Third International Conference on Knowledge Discovery and Data Mining
Heckerman, D. E., Mannila, H., Pregibon, D., & Uthurusamy, R. (1997) · Medical Entomology and Zoology · Cited by 178
An Analysis of Retail Display Space: Theory and Methods
Anderson, E. E. (1979) · The Journal of Business · doi:10.1086/296036 · Cited by 70
Cited by
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
Ahmed, C. F., Tanbeer, S. K., Jeong, B.-S., & Lee, Y.-K. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.46 · Cited by 583
Selecting the right objective measure for association analysis
Tan, P.-N., Kumar, V., & Srivastava, J. (2004) · Information Systems · doi:10.1016/s0306-4379(03)00072-3 · Cited by 568
Metadata
- Authors
- Brijs, T., Swinnen, G., Vanhoof, K., & Wets, G.
- Venue
- Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 254-260
- OpenAlex
- W1979943645
- Cited by
- 361
- References
- 18
- FWCI
- 4.99
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.