Frequent Pattern Mining using CATSIM Tree

Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 9

Abstract

Efficient algorithms to discover frequent patterns are essential in data mining research. Frequent pattern mining is emerging as powerful tool for many business applications such as e-commerce, recommender systems and supply chain management and group decision support systems to name a few. Several effective data structures, such as two-dimensional arrays, graphs, trees and tries have been proposed to collect candidate and frequent itemsets. It seems as the tree structure is most extractive to storing itemsets. The outstanding tree has been proposed so far is called FP-tree which is a prefix tree structure. Some advancement with the FP tree structure is proposed as CATS tree. CATS Tree extends the idea of FP-Tree to improve storage compression and allow frequent pattern mining without generation of candidate itemsets. It allows to mine only through a single pass over the database. The efficiency of Apriori, FP-Growth, CATS Tree for incremental mining is very poor. In all of the above mentioned algorithms, it is required to generate tree repeatedly to support incremental mining. The implemented CATSIM Tree uses more memory compared to Apriori, FP-Growth and CATS Tree, but with advancement in technology, is not a major concern. In this work CATSIM Tree with modifications in CATS Tree is implemented to support incremental mining with better results.

Authors and Affiliations

Ketan Modi , B. L. Pal

Keywords

Related Articles

Anonymous Ad Hoc Network Performance Degradation Analysis in the Presence of Selfish

Wireless Ad Hoc networks are characterized by dynamic change in topology, infrastructureless architecture and creation of a network on the fly. Being wireless and co-operative in nature Ad Hoc networks are more prone to...

Image Segmentation using Extended Edge Operator for Mammographic Images

Detection of edges in an image is a very important step owards understanding image features. Since edges often occur at mage locations representing object boundaries, edge etection is extensively used in image segmenta...

Comparative study on Relational data sets and XML data sets in J2EE system

In the real world extracting information entirely depends up on the type of the information, type of the structures used to maintain the information and type of the application programs used to extract the information. M...

Dual Moving Text Line Detection and Selective Masking

In this paper we are proposing a technique to extract a moving text-line in a video and split if there are dual moving text-line in it. In second stage we mask the one or both moving text-line to secure the information o...

INTENSIFICATION OF EDUCATIONAL CLOUD COMPUTING AND CRISIS OF DATA SECURITY IN PUBLIC CLOUDS

Cloud computing is an emerging technology that access emote servers through Internet to maintain data and pplications. It incorporates the advantages of grid and utility omputing. This paper expresses the mportance o...

Download PDF file
  • EP ID EP150961
  • DOI -
  • Views 118
  • Downloads 0

How To Cite

Ketan Modi, B. L. Pal (2012). Frequent Pattern Mining using CATSIM Tree. International Journal on Computer Science and Engineering, 4(9), 1594-1602. https://europub.co.uk/articles/-A-150961