Modified Prime Number Based Partition Algorithm
Full Text(PDF, 3000) PP.
| Author(s) |
|Mr. Praveen Kumar Mudgal, Prof. Ms. Shweta Modi|
| KEYWORDS |
Association Rule Mning,Cluster Based Partition Algorithm,Data mining,Frequent patterns,KDD,Support Count,Prime numbers.
Frequent pattern mining is always an interesting research area in data mining to mine several hidden and previously unknown pattern. The better algorithms are always introduced and become the topic of interest. Association rule mining is an implication of the form X implies Y, where X is a set of antecedent items and Y is the consequent items. There are several techniques have been introduced in data mining to discover frequent item sets. This paper describes a takes an approach for mining frequent pattern and suggest some modification. The new algorithm uses both the concepts of top-down and bottom-up approach.To calculate the support count prime representation of item sets is used .It enables to save time in calculating frequent item sets. Through this Efficiency of system improves when the frequent item sets are generating in lesser time.
 Arun K Pujari. Data Mining Techniques (Edition 5): Hyderabad,
India: Universities Press (India) Private Limited, 2003.
 Margatet H. Dunham. Data Mining, Introductory and Advanced
Topics: Upper Saddle River, New Jersey: Pearson Education Inc.,
 Jiawei Han. Data Mining, concepts and Techniques: San Francisco,
CA: Morgan Kaufmann Publishers.,2004.
 R.K. Gupta. Development of Algorithms for New Association
Rule Mining System, Ph.D. Thesis, Submitted to ABV-Indian Institute
of information Technology & Management, Gwalior, India,
 A. T. Bjorvand. Object Mining: A Practical Application of Data
Mining for the Construction and Maintenance of Software Components.
Proceedings of the Second European Symposium, PKDD-98,
Nantes, France, 1998, pp :121-129.
 Akhilesh Tiwari, R. K. Gupta, D.P. Agrawal, Mining Frequent
Itemsets Using Prime Number Based Approach. In Proc. 3rd International
Conference on Advanced Computing and Communication
Technologies (ICACCT), India, November 08-09,2008, pp: 138-141.
 M. Houtsma and A. Swami. Set Oriented Mining for Association
Rules in Relational Databases. In Proceedings of 11th International
conference on Data Engineering, 1995, pp 25-33.
 Agarwal R., Imielinski T., and Swami A. Mining associations
between sets of items in massive databases. In Proceedings of the
ACM SIGMOD International Conference on Management of Data,
Washington D.C. , May 1993, pp. 207-216.
 M. Houtsma and A. Swami, Set Oriented Mining for Association
Rules in RelationalDatabases. In Proceedings of 11th IEEE International
Conference on Data Engineering, 1995, pp : 25-33.
 Rakesh Agrawal and R. Srikant . Fast Algorithm for Mining
Association Rules in Large Databases, Proceedings of the 20th International
Conference on Very Large Databases, Santigo, Chile, 1994,
 Akhilesh Tiwari, Rajendra K. Gupta, and Dev Prakash Agrawal
Cluster Based Partition Approach for Mining Frequent Itemsets
IJCSNS International Journal of Computer Science and Network
Security, VOL.9 No.6, June 2009.
Dr.S.N.Sivanandam , Dr.S.Sumathi , Ms.T. Hamsapriya,
Mr.K.Babu Parallel Buddy Prima – A Hybrid Parallel Frequent itemset
mining algorithm for very large databases,Academic open internet