Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2011.021111
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 2 Issue 11, 2011.
Abstract: Past observations have shown that a frequent item set mining algorithm are purported to mine the closed ones because the finish provides a compact and a whole progress set and higher potency. Anyhow, the newest closed item set mining algorithms works with candidate maintenance combined with check paradigm that is pricey in runtime yet as space usage when support threshold is a smaller amount or the item sets gets long. Here, we show, CEG&REP that could be a capable algorithm used for mining closed sequences while not candidate. It implements a completely unique sequence finality verification model by constructing a Graph structure that build by an approach labeled “Concurrent Edge Prevision and Rear Edge Pruning” briefly will refer as CEG&REP. a whole observation having sparse and dense real-life knowledge sets proved that CEG&REP performs bigger compared to older algorithms because it takes low memory and is quicker than any algorithms those cited in literature frequently.
Anurag Choubey, Dr. Ravindra Patel and Dr. J.L. Rana, “Concurrent Edge Prevision and Rear Edge Pruning Approach for Frequent Closed Itemset Mining” International Journal of Advanced Computer Science and Applications(IJACSA), 2(11), 2011. http://dx.doi.org/10.14569/IJACSA.2011.021111