Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Predicting Missing Items in Shopping Cart using Associative Classification Mining

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 50 - Number 14
Year of Publication: 2012
Authors:
Ila Padhi
Jibitesh Mishra
Sanjit Kumar Dash
10.5120/7837-0773

Ila Padhi, Jibitesh Mishra and Sanjit Kumar Dash. Article: Predicting Missing Items in Shopping Cart using Associative Classification Mining. International Journal of Computer Applications 50(14):7-11, July 2012. Full text available. BibTeX

@article{key:article,
	author = {Ila Padhi and Jibitesh Mishra and Sanjit Kumar Dash},
	title = {Article: Predicting Missing Items in Shopping Cart using Associative Classification Mining},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {50},
	number = {14},
	pages = {7-11},
	month = {July},
	note = {Full text available}
}

Abstract

The primary task of association rule mining is to detect frequently co-occurring groups of items in transactional databases. The intention is to use this knowledge for prediction purposes. So many researches has focused mainly on how to expedite the search for frequently co-occurring groups of items in "shopping cart" and less attention has been paid to the methods that exploit these "frequent itemsets" for prediction purposes. This paper contributes to the latter task by proposing a technique that uses the partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy, for example, If bread, butter, and milk often appear in the same item, then the presence of butter and milk in a shopping cart suggests that the customer may also buy bread. More generally knowing which items a shopping cart contains, we want to predict often items that the customer is likely to add before proceeding to the checkouts. So this paper presents a technique called the "Combo Matrix" whose principal diagonal elements represent the association among items and looking to the principal diagonal elements, the customer can select what else the other items can be purchased with the currently contents of the shopping cart and also reduces the rule mining cost. The association among items is shown through Graph. The frequent itemsets are generated from the Combo Matrix. Then association rules are to be generated from the already generated frequent itemsets. The association rules generated form the basis for prediction. The incoming itemsets i. e. the contents of the shopping cart will be represented by set of unique indexed numbers and the association among items is generated through the Combo Matrix. Finally the predicted items are suggested to the Customer.

References

  • Agrawal. R, Imielinski. T and Swami. A, "Mining Association Rules between Sets of Items in Large Databases," Proc. ACM Special Interest Group on Management of Data (ACM SIGMOD), pp. 207-216, 1993.
  • M. Kubat, Hafez. A, Raghavan V. V, J. R. Lekkala and hen W. K. : "Itemset Trees for Targeted Association Querying," IEEE Trans . Knowledge and Data Eng. , vol. 15, no. 6, pp. 1522-1534, Nov. /Dec. 2003.
  • Kasun Wickramaratna ," Predicting missing Items in Shopping Carts", IEEE Transaction on Knowledge and data engineering, Vol. 21, No. 7, July 2009
  • C. C Aggarwal, C. Procopius, and P. S. Yu, "Finding Localized Associations in Market Basket Data," IEEE Transaction on Knowledge and Data": Eng. , vol. 14, no. 1, pp. 51-62, Jan. /Feb. 2002.
  • R. Bayardo and R. Agrawal, "Mining the Most Interesting Rules," Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 145-154, 1999.
  • Liu. B, Hsu, Y. M. WAND Ma,: "Integrating Classification and Association Rule Mining," Proc. ACM SIGKDD Int'l Conf. Know. Disc. Data. Mining (KDD '98), pp. 80-86, Aug. 1998.
  • Li . W, Han. J, and Pei. J, "CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules," Proc. IEEE Int'l Conf. Data Mining (ICDM '01), pp. 369-376, Nov. /Dec. 2001
  • Yen S. J. and Chen A " An efficient approach to discovering knowledge from large database". In proc. Of the IEEE/ACM International Conference on parallel distributed Information system, Pages 8-18, 1996.
  • Lee K. L, G Lee and Chen A. L. P. Efficient Graph based Algorithm for discovering and maintaining association rules in large database.