산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)
- 제21권48호
- /
- Pages.53-63
- /
- 1998
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
후보 2-항목집합의 개수를 최소화한 연관규칙 탐사 알고리즘
An Algorithm for Mining Association Rules by Minimizing the Number of Candidate 2-Itemset
초록
Mining for association rules between items in a large database of sales transaction has been described as an important data mining problem. The mining of association rules can be mapped into the problem of discovering large itemsets. In this paper we present an efficient algorithm for mining association rules by minimizing the total numbers of candidate 2-itemset, │C
키워드