A data mining framework for optimal product selection in retail supermarket data
Published 1 August 2000Open access
Tom Brijs, Bart Goethals, Gilbert Swinnen, Koen Vanhoof, Geert Wets
Citations83
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The authors present an important generalization of the existing PROFSET model in order to make it suitable for supermarket data as well, and to enable retailers to add category restrictions to the model.
Abstract
) " " %P I ) 0 25 t H ( 0$ G u 2 0 W 0v
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Finding interesting rules from large sets of discovered association rules
717 Citations1994Mika Klemettinen, Heikki Mannila +3 more
It is shown how a simple formalism of rule templates makes it possible to easily describe the structure of interesting rules, and how a visualization tool interfaces with rule templates.
University of Maribor digital library (University of Maribor)Discovering Data Mining: From Concept to Implementation
497 Citations1997Peter Cabena, Pablo Hadjinian +3 more
This book teaches newcomers all they need to know to profit from today's powerful data mining technologies and demonstrates IBM's powerful new Intelligent Miner tool and shows how it can be applied.
Pruning and summarizing the discovered associations
424 Citations1999Bing Liu, Wynne Hsu +1 more
The technique first prunes the discovered associations to remove those insignificant associations, and then finds a special subset of the unpruned associations to form a summary of the discovered association rules, which are then called the direction setting rules.
Data Mining and Knowledge DiscoveryBeyond Market Baskets: Generalizing Association Rules to Dependence Rules
374 Citations1998Craig Silverstein, Sergey Brin +1 more
This work develops the notion of dependence rules that identify statistical dependence in both the presence and absence of items in itemsets in the lattice and develops pruning strategies based on the closure property that lead to an efficient algorithm for discovering dependence rules.
Using association rules for product assortment decisions
364 Citations1999Tom Brijs, Gilbert Swinnen +2 more
This study integrates the discovery of frequent itemsets with a (microeconomic) model for product selection (PROFSET) that enables the integration of both quantitative and qualitative criteria and demonstrates the impact of product assortment decisions on overall assortment profitability can easily be evaluated by means of sensitivity analysis.
Data Mining and Knowledge DiscoveryA Microeconomic View of Data Mining
194 Citations1998Jon Kleinberg, Christos H. Papadimitriou +1 more
A rigorous framework, based on optimization, for evaluating data mining operations such as associations and clustering, in terms of their utility in decision-making is presented.
National University of SingaporePost-analysis of learned rules
149 Citations1996Bing Liu, Wynne Hsu
The proposed technique is general and highly interactive, and will be particularly useful in data mining and data analysis, where the rules may change over time and it is important to know what the changes are.
Interestingness-based interval merger for numeric association rules
91 Citations1998Ke Wang, Soon Hock William Tay +1 more
An algorithm for mining association rules from relational tables containing numeric and categorical attributes on the basis of maximizing the interestingness of a set of association rules is presented.
Lecture notes in computer scienceImproving the discovery of association rules with intensity of implication
35 Citations1998Sylvie Guillaume, Fabrice Guillet +1 more
A way to improve the rule-learning step in a Knowledge Discovery in Databases process to make possible the discovery of relevant rules in a large database.
Intelligent Data AnalysisReducing redundancy in characteristic rule discovery by using integer programming techniques
19 Citations2000Tom Brijs, Koen Vanhoof +1 more
An integer programming model is proposed to solve the problem of optimally selecting the most promising subset of characteristic rules and enables to control a user-defined level of overall quality of the model in combination with a maximum reduction of the redundancy extant in the original ruleset.