Ordering Policy Using Multi-Level Association Rule Mining

Ordering Policy Using Multi-Level Association Rule Mining

Reshu Agarwal (G. L. Bajaj Institute of Technology and Management, Greater Noida, India), Sarla Pareek (Banasthali University, Banasthali, India), Biswajit Sarkar (Hanyang University, Ansan, Republic of Korea) and Mandeep Mittal (Amity School of Engineering and Technology, New Delhi, India)
DOI: 10.4018/IJISSCM.2018100105

Abstract

In this article, an inventory model for a retailer's ordering policy is studied. Multi-level association rule mining is used to find frequent item-sets at each level by applying different threshold at different levels. During order quantity estimation, category, content, and brand of the items are considered, which leads to the discovery of more specific and concrete knowledge of the required order quantity. At each level, optimum order quantity of frequent items is determined. This assists inventory manager to order optimal quantity of items as per the actual requirement of the item with respect to their category, content and brand. An example is devised to explain the new approach. Further, to understand the effect of above approach in the real scenario, experiments are conducted on the exiting dataset.
Article Preview
Top

1. Introduction

Association rule mining is a data mining technique introduced by Agrawal et al. (1993) in which many rules are generated and tested on a dataset. It finds rules that satisfy user-specified constraints. Typical applications include retail market basket analysis, item recommendation systems, cross-selling, loss-leader analysis, etc. (Brijs et al. (1999)). Association rule mining aims to find rules of the form: X →Y, where X and Y are two sets of items. The meaning of the rule is that if the left-hand side X occurs, then the right-hand side Y is also very likely to occur. The utility of rules is often measured using support and confidence. Support is defined as the percentage of transactions in the data that contain all items in both the antecedent and the consequent of the rule. Confidence on the other hand is an estimate of the conditional probability of Y given X. Association rule mining output rules with support no less than minimum support and confidence no less than minimum confidence. The two thresholds are specified by users. Several approaches discover association rules at the terminal level of abstraction, i.e. the association rules containing only the items belonging to the transactions of database. Agrawal and Srikant (1994) developed algorithms for discovering all significant association rules between items in a large database of transactions. Zaki et al. (1997) developed a fast association rule mining algorithm which scans the database only once.

However, there is a need in many applications to discover association rules at higher levels of abstraction, these are multi-level association rules (Han and Fu, 1995) or generalized association rules (Srikant and Agrawal, 1995). In multi-level datasets, the data is available in different stages of abstraction or levels. Such levels are represented with concept hierarchies. For example, a user may not only be concerned with the associations between “milk” and “bread”, but also wants to know the association between Amul toned milk and Harvest white bread. Multi-level association rules may lead to the discovery of more specific and concrete knowledge from data as compared to single- level association rules. Instead of considering single attribute for the rules multiple attributes are considered to obtain more specific rules.

Complete Article List

Search this Journal:
Reset
Open Access Articles
Volume 14: 4 Issues (2021): Forthcoming, Available for Pre-Order
Volume 13: 4 Issues (2020): 3 Released, 1 Forthcoming
Volume 12: 4 Issues (2019)
Volume 11: 4 Issues (2018)
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing