Academic Journals Database
Disseminating quality controlled scientific knowledge

A Frame Work for Frequent Pattern Mining Using Dynamic Function

Author(s): Sunil Joshi | R S Jadon | R C Jain

Journal: International Journal of Computer Science Issues
ISSN 1694-0784

Volume: 8;
Issue: 3;
Start page: 141;
Date: 2011;
Original page

Keywords: Longest Common Subsequence | Frequent Pattern mining | dynamic function | candidate | transaction pair | association rule | vertical mining | IJCSI

Discovering frequent objects (item sets, sequential patterns) is one of the most vital fields in data mining. It is well understood that it require running time and memory for defining candidates and this is the motivation for developing large number of algorithm. Frequent patterns mining is the paying attention research issue in association rules analysis. Apriori algorithm is a standard algorithm of association rules mining. Plenty of algorithms for mining association rules and their mutations are projected on the foundation of Apriori Algorithm. Most of the earlier studies adopted Apriori-like algorithms which are based on generate-and-test candidates theme and improving algorithm approach and formation but no one give attention to the structure of database. Several modifications on apriori algorithms are focused on algorithm Strategy but no one-algorithm emphasis on least transaction and more attribute representation of database. We presented a new research trend on frequent pattern mining in which generate Transaction pair to lighten current methods from the traditional blockage, providing scalability to massive data sets and improving response time. In order to mine patterns in database with more columns than rows, we proposed a complete framework for the frequent pattern mining. A simple approach is if we generate pair of transaction instead of item id where attributes are much larger then transaction so result is very fast. Newly, different works anticipated a new way to mine patterns in transposed databases where there is a database with thousands of attributes but merely tens of stuff. We suggest a novel dynamic algorithm for frequent pattern mining in which generate transaction pair and for generating frequent pattern we find out by longest common subsequence using dynamic function. Our solutions give result more rapidly. A quantitative investigation of these tradeoffs is conducted through a wide investigational study on artificial and real-life data sets.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions