A Retail Itemset Placement Framework Based on Premiumness of Slots and Utility Mining

Retailer revenue is significantly impacted by item placement in retail stores. Notably, placement of items in the <italic>premium</italic> slots (i.e., slots with increased visibility/accessibility) improves the probability of sale w.r.t. item placement in non-premium slots. Moreover, customers often tend to buy sets of items (i.e., itemsets) instead of individual purchases. In this paper, we address the problem of maximizing retailer revenue by determining the placement of itemsets in different types of slots with varied <italic>premiumness</italic>. Our key contributions are as follows. First, we introduce the notion of <italic>premiumness of retail slots</italic> and discuss the issue of itemset placement in slots with varied premiumness. Second, we propose two <italic>efficient</italic> schemes, namely <inline-formula> <tex-math notation="LaTeX">${P}$ </tex-math></inline-formula>remiumness and <inline-formula> <tex-math notation="LaTeX">${R}$ </tex-math></inline-formula>evenue-based <inline-formula> <tex-math notation="LaTeX">${I}$ </tex-math></inline-formula>temset <inline-formula> <tex-math notation="LaTeX">${P}$ </tex-math></inline-formula>lacement (PRIP) and <inline-formula> <tex-math notation="LaTeX">${P}$ </tex-math></inline-formula>remiumness and <inline-formula> <tex-math notation="LaTeX">${A}$ </tex-math></inline-formula>verage <inline-formula> <tex-math notation="LaTeX">${R}$ </tex-math></inline-formula>evenue-based <inline-formula> <tex-math notation="LaTeX">${I}$ </tex-math></inline-formula>temset <inline-formula> <tex-math notation="LaTeX">${P}$ </tex-math></inline-formula>lacement (PARIP), for placing itemsets with varying revenue in slots with varied premiumness. Third, we perform a detailed performance analysis using both real and synthetic datasets to showcase the effectiveness of our proposed schemes. We also perform a comprehensive mathematical analysis of our proposed schemes w.r.t. the complexity analysis.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.