CFP last date
20 May 2024
Reseach Article

Faster Prediction of Missing Items in Shopping Carts using FUFP-DSARM

Published on August 2012 by Anagha Patil, Thirumahal R.
International Conference on Intuitive Systems and Solutions 2012
Foundation of Computer Science USA
ICISS - Number 1
August 2012
Authors: Anagha Patil, Thirumahal R.
8f66b640-dc7f-45e9-b906-eab444868d34

Anagha Patil, Thirumahal R. . Faster Prediction of Missing Items in Shopping Carts using FUFP-DSARM. International Conference on Intuitive Systems and Solutions 2012. ICISS, 1 (August 2012), 25-29.

@article{
author = { Anagha Patil, Thirumahal R. },
title = { Faster Prediction of Missing Items in Shopping Carts using FUFP-DSARM },
journal = { International Conference on Intuitive Systems and Solutions 2012 },
issue_date = { August 2012 },
volume = { ICISS },
number = { 1 },
month = { August },
year = { 2012 },
issn = 0975-8887,
pages = { 25-29 },
numpages = 5,
url = { /proceedings/iciss/number1/7954-1006/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Intuitive Systems and Solutions 2012
%A Anagha Patil
%A Thirumahal R.
%T Faster Prediction of Missing Items in Shopping Carts using FUFP-DSARM
%J International Conference on Intuitive Systems and Solutions 2012
%@ 0975-8887
%V ICISS
%N 1
%P 25-29
%D 2012
%I International Journal of Computer Applications
Abstract

Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn this data into rules. Previous research has focused on how to obtain list of these associations and use these "frequent item sets" for prediction purpose. This paper proposes a technique which uses partial information about the contents of the shopping carts for the prediction of what else the customer is likely to buy. Using Fast Updated Frequent Pattern Tree (FUFP-Tree) instead of Item set Trees (IT-Tree) and Frequent Pattern Tree (FP-Tree), all the rules whose antecedents contain at least one item from the incomplete shopping cart can be obtained in efficient manner. Rules are then combined and Prediction is done using Bayesian Decision Theory and DS-ARM algorithm based on the Dempster-Shafter theory of evidence combination.

References
  1. K. Wickramaratna, M. Kubat, K. Premarathnes, "Predicting Missing Items in Shopping Carts," IEEE Trans. On Knowledge and Data Engineering, Vol. 21, No. 7, July 2009.
  2. M. Kubat, A. Hafez, V. V. Raghavan, J. R. Lekkala, and W. K. Chen, "Itemset Trees for Targeted Association Querying," IEEE Trans. On Knowledge and Data Engineering, vol. 15, no. 6, pp. 1522-1534, Nov. /Dec. 2003.
  3. J. Zhang, Subasingha, K. Premaratne, Shyu, M. Kubat, and Hewawasam, "A novel belief theoretic association rule mining based classifier for handling class label ambiguities," in Proc. FDM Workshop, IEEE ICDM, Brighton, U. K. , Nov. 2004, pp. 213–222.
  4. D. H. G. Resconi, G. J. Klir, and Y. Pan, "On the computation of the uncertainty measure for the Dempster– Shafer theory," Int. J. Gen. Syst. , vol. 25, no. 2, pp. 153–163, 1996.
  5. Tzung-Pei-Hong, Chun-Wei Lin, Yu-Lung Wu, "Incrementlly Fast Updated Pattern Trees," Expert Systems with applications , vol. 34, pp- 2424-2435, 2008.
  6. A. Rozsypal and M. Kubat, "Association Mining in Time-Varying Domains," Intelligent Data Analysis, vol. 9, pp. 273-288, 2005.
  7. C. C. Aggarwal, C. Procopius, and P. S. Yu, "Finding Localized Associations in Market Basket Data," IEEE Trans. On Knowledge and Data Engineering, vol. 14, no. 1, pp. 51-62, Jan. /Feb. 2002.
  8. R. Agarwal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases," Proc. ACM SIGMOD, pp. 207-216, 1993.
Index Terms

Computer Science
Information Sciences

Keywords

Frequent Item Sets Market Baskets Dempster-shafter Theory It-tree Fp-tree Fufp-tree