Author : Nikhil Gumaste 1
Date of Publication :29th March 2018
Abstract: Discovering information from expansive informational collections to use in intelligent systems turns out to be increasingly essential in the Internet period. Pattern mining, classification, text mining, and opinion mining are the topical issues. Among them, pattern mining is a important issue. The issue of mining erasable patterns (EPs) has been proposed as a variation of frequent pattern mining for optimizing the generation plan of production factories. A few algorithms have been proposed for effectively mining EPs. Be that as it may, for extensive limit esteems, many EPs are acquired, prompting substantial memory use. In this manner, it is important to mine a consolidated portrayal of EPs. This paper first defines erasable closed patterns (ECPs), which can represent to the set of EPs without data loss. At that point, a theorem for quick deciding ECPs in view of dPidset structure is proposed and demonstrated. Next, two efficient algorithms [erasable closed patterns mining (ECPat) and dNC_Set based algorithm for erasable closed patterns mining (dNC-ECPM)] for mining ECPs in view of this theorem are proposed
Reference :