A new heuristic for learning Bayesian networks from limited datasets: a real-time recommendation system application with RFID systems in grocery stores

A new heuristic for learning Bayesian networks from limited datasets: a real-time recommendation system application with RFID systems in grocery stores

0.00 Avg rating0 Votes
Article ID: iaor20163513
Volume: 244
Issue: 2
Start Page Number: 385
End Page Number: 405
Publication Date: Sep 2016
Journal: Annals of Operations Research
Authors: ,
Keywords: retailing, heuristics, learning
Abstract:

Bayesian networks (BNs) are a useful tool for applications where dynamic decision‐making is involved. However, it is not easy to learn the structure and conditional probability tables of BNs from small datasets. There are many algorithms and heuristics for learning BNs from sparse datasets, but most of these are not concerned with the quality of the learned network in the context of a specific application. In this research, we develop a new heuristic on how to build BNs from sparse datasets in the context of its performance in a real‐time recommendation system. This new heuristic is demonstrated using a market basket dataset and a real‐time recommendation model where all items in the grocery store are RFID tagged and the carts are equipped with an RFID scanner. With this recommendation model, retailers are able to do real‐time recommendations to customers based on the products placed in cart during a shopping event.

Reviews

Required fields are marked *. Your email address will not be published.