• Shilpa Sudersahn Kumar
• Swaroopa Shastri
• Sony

In the current internet era the first thing we have to deal with is the huge data. We have many ways to deal with this kind of problem such as pattern mining (PM), data-classification, text-mining and opinion mining. Among all these other, pattern mining is the important issue. While optimizing the product plans of the organization data, we propose the mining erasable patterns as an alternative of the frequent pattern mining, but while working with large amount of data there also product large amount erasable patterns which in turn consumes large amount of memory. Therefore it has become important to produce condensed erasable patterns. Here we propose a system in which we first define the erasable closed patters which again represents the set of erasable patterns without any information loss, after collecting the erasable patterns we will implement method for determining the erasable closed patterns faster based on the product ID set. Next we implement efficient algorithms ECPat and dNC-ECPM for the creation of ECPs. The experimental result says that the ECP suits best for mining of the erasable closed patterns by reducing the process time and memory usage for all datasets.

Erasable Itemsets (EI), Erasable Closed Pattern Mining (ECPM), Erasable Closed Patterns (ECPs), Data Mining (DM), Pattern Mining (PM), Mining Erasable Itemsets (MEI), Erasable Itemsets for very Dense Datasets (EIFDD).

"A Proficient Method For Mining ECPs from Transactional Dataset ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 10, page no.125-128, October-2018, Available :http://www.jetir.org/papers/JETIR1810718.pdf

"A Proficient Method For Mining ECPs from Transactional Dataset ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 10, page no. pp125-128, October-2018, Available at : http://www.jetir.org/papers/JETIR1810718.pdf