Skip to content

Improving sales of All Night Canteen of BITS Pilani using Association Rule Mining. We introduce combo offers and implement a dynamic pricing scheme to increase sales, and hence profits by 5% without much penalty.

Notifications You must be signed in to change notification settings

nmakes/ANC-data-mining

Repository files navigation

ANC DATA MINING

Observing BITS Pilani's All Night Canteen (ANC) transactions to improve profits

Problem statement is given in DM Assignment Problem Statement.pdf

Problem 1: To implement a dynamic pricing scheme depending on the amount of sale for each hour of the day. Problem 2: To pair popular products with less popular ones to introduce combo offers for sale maximization. Problem 3: To infer from some interesting observations in the sales.

Our approach has been summarized (Problem i-Summary) and explained in detail (Problem i-detail.pdf).

Jointly Developed By Naveen Venkat (2015A7PS0078P) Rohan Saxena (2015A7TS0017P)

About

Improving sales of All Night Canteen of BITS Pilani using Association Rule Mining. We introduce combo offers and implement a dynamic pricing scheme to increase sales, and hence profits by 5% without much penalty.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages