Top Down Approach to find Maximal Frequent Item Sets using Subset Creation
Abstract
Association rule has been an area of active research in the field of knowledge discovery. Data mining researchers had improved upon the quality of association rule mining for business development by incorporating influential factors like value (utility), quantity of items sold (weight) and more for the mining of association patterns. In this paper, we propose an efficient approach to find maximal frequent itemset first. Most of the algorithms in literature 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 navel 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.
Cite
@article{arxiv.1210.8229,
title = {Top Down Approach to find Maximal Frequent Item Sets using Subset Creation},
author = {Jnanamurthy H. K. and Vishesh H. V. and Vishruth Jain and Preetham Kumar and Radhika M. Pai},
journal= {arXiv preprint arXiv:1210.8229},
year = {2012}
}