Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2010.17D.1.001

Utilizing the Effect of Market Basket Size for Improving the Practicality of Association Rule Measures  

Kim, Won-Seo (국민대학교 비즈니스IT전문대학원)
Jeong, Seung-Ryul (국민대학교 비즈니스IT전문대학원)
Kim, Nam-Gyu (국민대학교 비즈니스IT전문대학원)
Abstract
Association rule mining techniques enable us to acquire knowledge concerning sales patterns among individual items from voluminous transactional data. Certainly, one of the major purposes of association rule mining is utilizing the acquired knowledge to provide marketing strategies such as catalogue design, cross-selling and shop allocation. However, this requires too much time and high cost to only extract the actionable and profitable knowledge from tremendous numbers of discovered patterns. In currently available literature, a number of interest measures have been devised to accelerate and systematize the process of pattern evaluation. Unfortunately, most of such measures, including support and confidence, are prone to yielding impractical results because they are calculated only from the sales frequencies of items. For instance, traditional measures cannot differentiate between the purchases in a small basket and those in a large shopping cart. Therefore, some adjustment should be made to the size of market baskets because there is a strong possibility that mutually irrelevant items could appear together in a large shopping cart. Contrary to the previous approaches, we attempted to consider market basket's size in calculating interest measures. Because the devised measure assigns different weights to individual purchases according to their basket sizes, we expect that the measure can minimize distortion of results caused by accidental patterns. Additionally, we performed intensive computer simulations under various environments, and we performed real case analyses to analyze the correctness and consistency of the devised measure.
Keywords
Association Rule Mining; Data Mining; Market Basket Analysis; Interest Measures;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 J. Han and M. Kamber, “Data Mining: Concepts and Techniques,” Morgan Kaufmann Publishers, California, 2007.
2 D. Olson and Y. Shi, “Introduction to Business Data Mining,” McGraw-Hill, New York, 2007.
3 K. Wang, Y. He, and J. Han, “Pushing Support Constraints into Association Rule Mining,” IEEE Transactions on Knowledge and Data Engineering, Vol.15, No.3, pp.642-657, 2003.   DOI   ScienceOn
4 W. Y. Lin and M. C. Tseng, “Automated Support Specification for Efficient Mining of Interesting Association Rules,” Journal of Information Science, Vol.32, No.3, pp.238-250, 2006.   DOI
5 채덕진, 김룡, 이용미, 황부현, 류근호, “한 번의 데이터베이스 탐색에 의한 빈발항목집합 탐색,” 정보처리학회논문지(D), 제15권, 제1호, pp.15-30, 2008.   과학기술학회마을   DOI   ScienceOn
6 R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” in Proc. ACM SIGMOD International Conference on Management of Data, Washington D.C, pp.207-216, 1993.
7 R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," in Proc. 20th International Conference on Very Large Data Bases, Santiago, Chile, pp.487-499, 1994
8 C. Cooper and M. Zito, “Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases,” in Proc. 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, pp.398-405, 2007.
9 한경록, “CRM과 SCM의 전략적 통합을 위한 데이터 마이닝의 활용,” LGCNS 엔트루정보기술연구소, 제7권, pp.151-161, 2008.
10 한갑수, “연관규칙 탐사 응용을 위한 한 번 읽기에 의한 최대크기 빈발항목 추정기법,” 정보처리학회논문지(D), 제15권, 제4호, pp.475-484, 2008.   DOI   ScienceOn
11 송명진, 김대인, 황부현. “인터벌이벤트의 영향력관계에 기반한 연관규칙 탐사기법,” 한국정보과학회 2009 한국컴퓨터종합학술대회 논문집(C), 제36권, 제1호, pp.96-100, 2009.
12 P. Lenca, P. Meyer, B. Vaillant, and S. Lallich, “On Selecting Interestingness Measures for Association Rules: User Oriented Description and Multiple Criteria Decision Aid,” European Journal of Operational Research, Vol.184, No.2, pp.610-626, 2008.   DOI   ScienceOn
13 B. Barber and H. Hamilton, “Extracting Share Frequent Itemsets with Infrequent Subsets,” Data Mining and Knowledge Discovery, Vol.7, pp.153-185, 2003.   DOI   ScienceOn
14 L. Geng and H. J. Hamilton, “Interestingness Measures for Data Mining: A Survey,” ACM Computing Surveys, Vol.38, No.3, 2006.   DOI   ScienceOn
15 P. Lenca, B. Vaillant, P. Meyer, and S. Lallich, “Association Rule Interestingness Measures: Experimental and Theoretical Studies,” Quality Measures in Data Mining, Chap.3, Springer, pp.51-76, 2007.
16 R. Agrawal, M. Mehta, J. C. Shafer, R. Srikant, A. Arning, and T. Bollinger, “The Quest Data Mining System,” in Proc. 2nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, pp.244-249, 1996.
17 김남규, “장바구니 크기가 연관규칙 척도의 정확성에 미치는 영향,” 경영정보학연구, 제18권, 제2호, pp.95-114, 2008.
18 P. N. Tan, V. Kumar, and J. Srivastava, “Selecting the Right Interestingness Measure for Association Patterns,” in Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Alberta, Canada, pp.32-41, 2002.