Finding Frequent Pattern with Transaction and Occurrences based on Density Minimum Support Distribution

The importance of data mining is increasing exponentially since last decade and in recent time where there is very tough competition in the market where the quality of information and information on time play a very crucial role in decision making of policy has attracted a great deal of attention in the information industry and in society as a whole. In this approach we also use density minimum support so that we reduce the execution time. A frequent superset means it contains more transactions then the minimum support. It utilize the concept that if the item set is not frequent but the superset may be frequent which is consider for the further data mining task. By this approach we can store the transaction on the daily basis, then we provide three different density zone based on the transaction and minimum support which is low(L), Medium(M),High(H). Based on this approach we categorize the item set for pruning. Our approach is based on apriori algorithm but provides better reduction in time because of the prior separation in the data, which is useful for selecting according to the density wise distribution in India. Our algorithm provides the flexibility for improved association and dynamic support. Comparative result shows the effectiveness of our algorithm.

[1]  Shishir K. Shandilya,et al.  A Novel J2ME Service for Mining Incremental Patterns in Mobile Computing , 2010, ICT.

[2]  K. Zuhtuogullari,et al.  An improved itemset generation approach for mining medical databases , 2011, 2011 International Symposium on Innovations in Intelligent Systems and Applications.

[3]  Nikolaos M. Avouris,et al.  The Role of Domain Knowledge in a Large Scale Data Mining Project , 2002, SETN.

[4]  C S Ashwin,et al.  SPAAT-a modern tree based approach for sequential pattern mining with minimum support , 2011, Fourth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2011).

[5]  Smriti Pandey,et al.  A Novel Wireless Heterogeneous Data Mining (WHDM) Environment Based on Mobile Computing Environments , 2011, 2011 International Conference on Communication Systems and Network Technologies.

[6]  Charu C. Aggarwal,et al.  A Tree Projection Algorithm for Generation of Frequent Item Sets , 2001, J. Parallel Distributed Comput..

[7]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[8]  R. Agarwal.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[9]  Zahid Halim,et al.  Weighted MUSE for Frequent Sub-Graph Pattern Finding in Uncertain DBLP Data , 2011, 2011 International Conference on Internet Technology and Applications.

[10]  Srinivasan Parthasarathy,et al.  New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[11]  Hongjun Lu,et al.  H-mine: hyper-structure mining of frequent patterns in large databases , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[12]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[13]  Nishant Shrivastava,et al.  Heterogeneous Data Mining Environment Based on DAM for Mobile Computing Environments , 2011 .

[14]  Jignesh M. Patel,et al.  Efficient and Accurate Discovery of Patterns in Sequence Data Sets , 2011, IEEE Transactions on Knowledge and Data Engineering.

[15]  W. H. Inmon,et al.  The data warehouse and data mining , 1996, CACM.

[16]  Meenu Tahilyani,et al.  A Novel Reconfigurable Character based Token Set Pruner (RCBTSP) for Heterogeneous Environment , 2011 .

[17]  Xianghui Hui,et al.  Application of Data Mining Techniques in Higher College Teaching , 2011 .