[논문]장바구니 크기가 연관규칙 척도의 정확성에 미치는 영향

김남규

[국내논문] 장바구니 크기가 연관규칙 척도의 정확성에 미치는 영향
Effect of Market Basket Size on the Accuracy of Association Rule Measures 원문보기

경영정보학연구 = The journal of MIS research, v.18 no.2, 2008년, pp.95 - 114

Abstract ▼ AI-Helper

Recent interests in data mining result from the expansion of the amount of business data and the growing business needs for extracting valuable knowledge from the data and then utilizing it for decision making process. In particular, recent advances in association rule mining techniques enable us to acquire knowledge concerning sales patterns among individual items from the voluminous transactional data. Certainly, one of the major purposes of association rule mining is to utilize acquired knowledge in providing marketing strategies such as cross-selling, sales promotion, and shelf-space allocation. In spite of the potential applicability of association rule mining, unfortunately, it is not often the case that the marketing mix acquired from data mining leads to the realized profit. The main difficulty of mining-based profit realization can be found in the fact that tremendous numbers of patterns are discovered by the association rule mining. Due to the many patterns, data mining experts should perform additional mining of the results of initial mining in order to extract only actionable and profitable knowledge, which exhausts much time and costs. In the literature, a number of interestingness measures have been devised for estimating discovered patterns. Most of the measures can be directly calculated from what is known as a contingency table, which summarizes the sales frequencies of exclusive items or itemsets. A contingency table can provide brief insights into the relationship between two or more itemsets of concern. However, it is important to note that some useful information concerning sales transactions may be lost when a contingency table is constructed. For instance, information regarding the size of each market basket(i.e., the number of items in each transaction) cannot be described in a contingency table. It is natural that a larger basket has a tendency to consist of more sales patterns. Therefore, if two itemsets are sold together in a very large basket, it can be expected that the basket contains two or more patterns and that the two itemsets belong to mutually different patterns. Therefore, we should classify frequent itemset into two categories, inter-pattern co-occurrence and intra-pattern co-occurrence, and investigate the effect of the market basket size on the two categories. This notion implies that any interestingness measures for association rules should consider not only the total frequency of target itemsets but also the size of each basket. There have been many attempts on analyzing various interestingness measures in the literature. Most of them have conducted qualitative comparison among various measures. The studies proposed desirable properties of interestingness measures and then surveyed how many properties are obeyed by each measure. However, relatively few attentions have been made on evaluating how well the patterns discovered by each measure are regarded to be valuable in the real world. In this paper, attempts are made to propose two notions regarding association rule measures. First, a quantitative criterion for estimating accuracy of association rule measures is presented. According to this criterion, a measure can be considered to be accurate if it assigns high scores to meaningful patterns that actually exist and low scores to arbitrary patterns that co-occur by coincidence. Next, complementary measures are presented to improve the accuracy of traditional association rule measures. By adopting the factor of market basket size, the devised measures attempt to discriminate the co-occurrence of itemsets in a small basket from another co-occurrence in a large basket. Intensive computer simulations under various workloads were performed in order to analyze the accuracy of various interestingness measures including traditional measures and the proposed measures.

Keyword

참고문헌 (21)

Agrawal, R., Imielinski, T., and Swami, A., 'Mining Association Rules between Sets of Items in Large Databases,' in Proc. ACM SIGMOD International Conference on Management of Data, Washington D.C., 1993, pp. 207-216
Agrawal, R., Mehta, M., Shafer, J.C., Srikant, R., Arning, A., and Bollinger, T., 'The Quest Data Mining System,' in Proc. 2nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, 1996, pp. 244-249
Agrawal, R. and Srikant, R., 'Fast Algorithms for Mining Association Rules,' in Proc. 20th International Conference on Very Large Data Bases, Santiago, Chile, 1994, pp. 487-499
Barber, B. and Hamilton, H., 'Extracting Share Frequent Itemsets with Infrequent Subsets,' Data Mining and Knowledge Discovery, Vol. 7, 2003, pp. 153-185

상세보기
Brin, S., Motwani, R., and Silverstein, C., 'Beyond Market Baskets: Generalizing Association Rules to Correlations,' in Proc. ACM SIGMOD International Conference of Management of Data, Tucson, Arizona, 1997, pp. 265-276
Cai, C.H., Fu, A.W.C., Cheng, C.H., and Kwong, W.W., 'Mining Association Rules with Weighted Items,' in Proc. 10th International Symposium on Database Engineering and Applications, Wales, U.K., 1998, pp. 68-77
Carter, C.L., Hamilton, H.J., and Cercone, N., 'Shared Based Measures for Itemsets,' in Proc. 1st European Symposium on the Principles of Data Mining and Knowledge Discovery, Trondheim, Norway, 1997, pp. 14-24
Chen, M.S., Han, J., and Yu, P.S., 'Data Mining: An Overview from a Database Perspective,' IEEE Transactions on Knowledge and Data Engineering, Vol. 8, 1996, pp. 866-883

상세보기
Cooper, C., and Zito, M., '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, 2007, pp. 398-405
Geng, L. and Hamilton, H.J., 'Interestingness Measures for Data Mining: A Survey,' ACM Computing Surveys, Vol. 38, No. 3, 2006
Han, J. and Kamber M., Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, California, 2007
Hu, Y.H. and Chen, Y.K., 'Mining Association Rules with Multiple Minimum Supports: A New Mining Algorithm and a Support Tuning Mechanism,' Decision Support Systems, Vol. 42, 2006, pp. 1-24

상세보기
Lenca, P., Meyer, P., Vaillant, B., and Lallich, S., 'On Selecting Interestingness Measures for Association Rules: User Oriented Description and Multiple Criteria Decision Aid,' European Journal of Operational Research, Vol. 184, No. 2, 2008, pp. 610-626

상세보기
Lenca, P., Vaillant, B., Meyer, P., and Lallich, S., 'Association Rule Interestingness Measures: Experimental and Theoretical Studies,' Quality Measures in Data Mining, Chap. 3, Springer, 2007, pp. 51-76
Lin, W.Y. and Tseng, M.C., 'Automated Support Specification for Efficient Mining of Interesting Association Rules,' Journal of Information Science, Vol. 32, No. 3, 2006, pp. 238-250

상세보기
Liu, B., Hsu, W., and Ma, Y., 'Mining Association Rules with Multiple Minimum Supports,' in Proc. 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, California, 1999, pp. 337-341
Olson, D. and Shi, Y., Introduction to Business Data Mining, McGraw-Hill, New York, 2007
Tan, P.N., Kumar, V., and Srivastava, J., 'Selecting the Right Interestingness Measure for Association Patterns,' in Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Alberta, Canada, 2002, pp. 32-41
Tao, F., Murtagh, F., and Farid, M., 'Weighted Association Rule Mining using Weighted Support and Significance Framework,' in Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington D.C., 2003, pp. 661-666
Vaillant, B., Lenca, P., and Lallich, S., 'A Clustering of Interestingness Measures,' in Proc, 7th International Conference on Discovery Science, Padova, Italy, 2004, pp. 290-297
Wang, K., He, Y., and Han, J., 'Pushing Support Constraints into Association Rule Mining,' IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 3, 2003, pp. 642-657

상세보기

저자의 다른 논문 :

활용도 분석정보

상세보기

다운로드

내보내기

활용도 Top5 논문

해당 논문의 주제분야에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.

표제어: PCR

동의어: Packet Collision Rate

용어 설명 출처 목록 (6)

용어 설명: PCR은 세균 특이성이 있는 primer를 이용하여 적은 수의 세균이 있을지라도 쉽게 검출할 수 있는 유용한 방법이며, 이를 이용하여 구강 내 치면세균막이나 타액에서 직접 세균을 검출할 수 있게 되었다[8].

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증