• R.Prabamanieswari
• D.S.Mahendran

Recently, most of the applications will not need precise support information for frequent pattern. They approximate the frequency of every frequent pattern with a guaranteed maximal error bound. But, these algorithms generally have some problems and challenges while processing large-scale data. Therefore, the parallel approach has emerged as an important research topic. This paper implements the algorithm ModifiedRPset in a parallel manner while creating NCFP-tree. It follows the concepts such as considering closed patterns, finding C(X)s for closed patterns and applying greedy set cover algorithm which are same as in the previous algorithms MinRPset and ModifiedRPset. The experiment results show that the proposed algorithm gives better execution time for finding a small number of representative

Frequent itemset, threaded NCFP-tree, greedy method, representative pattern sets

"A Parallel Approach to ModifiedRPset ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.365-371, February-2019, Available :http://www.jetir.org/papers/JETIRAB06064.pdf

"A Parallel Approach to ModifiedRPset ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp365-371, February-2019, Available at : http://www.jetir.org/papers/JETIRAB06064.pdf