http://www.iaeme.com/IJCET/index.asp 50 editor@iaeme.com International Journal of Computer Engineering & Technology (IJCET) Volume 7, Issue 6, November–December 2016, pp. 50–54, Article ID: IJCET_07_06_006 Available online at http://www.iaeme.com/ijcet/issues.asp?JType=IJCET&VType=7&IType=6 Journal Impact Factor (2016): 9.3590(Calculated by GISI) www.jifactor.com ISSN Print: 0976-6367 and ISSN Online: 0976–6375 © IAEME Publication DESIGN OF TRANSACTIONAL PREDICTION USING PLAN MINE AND GENETIC ALGORITHMS R.P.S. Manikandan Assistant Professor, Department of IT, Sri Shakthi Institute of Engineering & Technology, Coimbatore, India Dr. A.M. Kalpana Professor, Head/Department of CSE, Government College of Engineering, Salem, India ABSTRACT In this paper, we represent Plan Mine Algorithm to discover the prediction problem in the context of plan failure. The Existing remedies for the problem create failures, by filtering out the frequent patterns but it also having uninteresting events. Hence by removing the irrelevant and uninterested data by means of Plan Mine techniques, the remaining data becomes more dominant and crisp in the data set. The Frequent Transactions in the online shopping makes the business more effectively and successively. Key words: Genetic Algorithm, PlanMine, Pruning, Frequent Pattern, Mutation. Cite this Article: R.P.S. Manikandan and Dr. A.M. Kalpana, Design of Transactional Prediction using Plan Mine and Genetic Algorithms. International Journal of Computer Engineering and Technology, 7(6), 2016, pp. 50–54. http://www.iaeme.com/ijcet/issues.asp?JType=IJCET&VType=7&IType=6 1. INTRODUCTION In Plan Mine, we introduce Genetic Algorithms. In order for the initial classification of sequence rules, the techniques called production system introduced. Then Pruning is applied in the following phases. The Dataset can be classified into relevant and interesting data called as good data set and relevant but uninteresting data; we called it as bad dataset. So in order to improvise the business, the good events are to be collected and need to be stored and at the same time the bad events are to be retained. Though the good events data sets are not used for prediction, they act as a reference in the subsequent pruning stages. The second pruning phase removes patterns which correspond to the sequence that provides support in the dataset of worst plan. Moreover, it provides very good level of support in the dataset of good plans. The Third pruning phase removes the redundant patterns. A sequence is said to be redundant if it contains a sub sequence having the same support value as itself for both data sets. At last the same kind of patterns was removed, if it contains any sub sequence that kind of patterns were captured.