Survey Conducted On Algorithms For Finding Frequent And Closed Frequent Itemset With Incremental Approach
| Author(s) | : | Nidhi Dangar, Trupti Kodinariya |
| Institution | : | Computer Department, Gujarat Technological University Address |
| Published In | : | Vol. 2, Issue 14 — January 2015 |
| Page No. | : | - |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Data Mining (also known as Knowledge Discoveryfrom Database KDD) is defined as extracting requiredknowledge from large available data. Association rule mining isdefined as finding correlation among various items in availablelarge dataset and finding useful knowledge and patterns fromthem. Frequent itemset is defined as finding the items with moreoccurrences in the dataset than other items. In recent time , datamining is an emerging field as execution speed and timeconsumption with incremental database is highly demanded .Inthis paper , a survey is conducted over association rule miningand frequent and closed frequent itemset , that how much workdone in these fields recently and before. The basic purposebehind the survey is to compare different approaches and findone better approach which can efficiently find set of frequent andclosed frequent item with incremental database.
Nidhi Dangar, Trupti Kodinariya, “Survey Conducted On Algorithms For Finding Frequent And Closed Frequent Itemset With Incremental Approach”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 2, Issue 14, pp. -, January 2015.
