Title:

A Dynamic Approach for Discovering Maximal Frequent itemsets

Introduction: We present a novel method, which reads the database at regular intervals as in Dynamic Item sets Counting Technique and creates a tree called Dynamic Itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items.

Existing System: In the current scenario, the statistical information of various formats of the collection of items in a group are obtained by using various searching and sorting techniques which are time consuming, memory usage models. The user while working with the items has to implement his manual efficiency to trace the list of the selected items in the transactions in various itemset collection to identify the most frequently selected item set in all item set groups supporting the minimum support provided. Since ther is no appropriate method to search for the item set results, hence there is a requirement to build an application that makes it easy and efficient in fetching the item collection at various item sets. Prosposed System: The proposed Application is a desktop application that is used to accept the items and transactions performed on them as inputs to calculate the required outputs based on the given required item set count and the minimum support provided to it. It uses the concept of BFS and DFS along with the APRIORI algorithm to trace the required output. It also calculates the time taken to calculate the output at each level and the over all time taken for the collection of transactions.

Modules List: 1. Login & Security: This module accepts the username and password from the user which on validation passes the control into the module.

2. Items Info: This is used to maintain the information of the items/products used in the application. New items can be added and the existing items can be altered or deleted.

3. Transactions: This module helps in generating the transactions by using the available items/products. Each transaction is associated with unique transaction id. New transaction can be added and existing transactions can be edited or deleted.

4. Result Calculation: This module accepts the table name containing transactions, Item Count Set and the minimum support for the calculation and generates the screens as output for the given Item Count Set.

Software Requirements: Operating System: Windows Language: Java (Swings, JDBC)

Back End: Oracle/ SQL Server

Hardware Requirements: Processor: Pentium IV RAM: 1 GB

Hard Disk: 40 GB