期刊名称：International Journal of Data Mining & Knowledge Management Process
印刷版ISSN：2231-007X
电子版ISSN：2230-9608
出版年度：2013
卷号：3
期号：1
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Data mining is the practice to search large amount of data to discover data patterns. Data mining uses mathematical algorithms to group the data and evaluate the future events. Association rule is a research area in the field of knowledge discovery. Many data mining researchers had improved upon the quality of association rule for business development by incorporating influential factors like utility, number of items sold and for the mining of association data patterns. In this paper, we propose an efficient algorithm to find maximal frequent itemset first. Most of the association rule algorithms used to find minimal frequent item first, then with the help of minimal frequent itemsets derive the maximal frequent itemsets, these methods consume more time to find maximal frequent itemsets. To overcome this problem, we propose a new approach to find maximal frequent itemset directly using the concepts of subsets. The proposed method is found to be efficient in finding maximal frequent itemsets.
关键词：Data Mining (DM); Frequent ItemSet (FIS); Association Rules (AR); Apriori Algorithm (AA); Maximal;Frequent Item First (MFIF).
