Concurrent Edge Prevision and Rear Edge Pruning Approach for Frequent Closed Itemset Mining
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 11
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.
Authors and Affiliations
Anurag Choubey , Dr. Ravindra Patel , Dr. J. L. Rana
Keywords
Related Articles
- EP ID EP140044
- DOI -
- Views 101
- Downloads 0
Telugu Bigram Splitting using Consonant-based and Phrase-based Splitting
Splitting is a conventional process in most of Indian languages according to their grammar rules. It is called ‘pada vicchEdanam’ (a Sanskrit term for word splitting) and is widely used by most of the Indian languages. S...
DDoS Attacks Classification using Numeric Attribute-based Gaussian Naive Bayes
Cyber attacks by sending large data packets that deplete computer network service resources by using multiple computers when attacking are called Distributed Denial of Service (DDoS) attacks. Total Data Packet and import...
Message Segmentation to Enhance the Security of LSB Image Steganography
Classic Least Significant Bit (LSB) steganography technique is the most used technique to hide secret information in the least significant bit of the pixels in the stego-image. This paper proposed a technique by sp...
Using Fuzzy Clustering Powered by Weighted Feature Matrix to Establish Hidden Semantics in Web Documents
Digital Data is growing exponentially exploding on the 'World Wide Web'. The orthodox clustering algorithms obligate various challenges to tackle, of which the most often faced challenge is the uncertainty. Web documents...
A Schedule Optimization of Ant Colony Optimization to Arrange Scheduling Process at Certainty Variables
This research aims to get optimal collision of schedule by using certainty variables. Courses scheduling is conducted by ant colony algorithm. Setting parameters for intensity is bigger than 0, visibility track is bigger...