Research article · 11 Jul 2015
Research articlePublished Aug 2015
An Efficient Algorithm for Finding the Support Count of Frequent 1-Itemsets in Frequent Pattern Mining
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Frequent itemset (or frequent pattern) mining is a very important issue in the data mining field. Both syntactic simplicity and descriptive potential, are the key features of the itemset-based pattern which have led to its widespread use in a growing number of real-life domains. Many efficient algorithms like Apriori & FP-Growth Algorithm are used to find frequent itemsets from large database. In almost all Frequent Pattern mining algorithms generating Frequent 1-itemsets are generated in order to find the support count(occurences) of each item in the entire transactions. This task is itself a tedious task in generating Frequent Patterns when considering the hugeness of modern databases available. No explicit strategy has been outlined in these algorithms to perform the aforesaid task. In this paper an efficient tree called Support Count tree has been proposed to perform this task. This algorithm can be easily embedded into any of the existing algorithms aimed at frequent pattern mining. With the help of this tree Frequent 1- Itemsets are found out quickly and efficiently which in-turn speeds up the generation of Frequent Patterns of the entire database.
Ask about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Dec 2014
Mining Frequent Itemset Using Parallel Computing Apriori Algorithm
Research article · Oct 2014
A Survey of Frequent and Infrequent Weighted Itemset Mining Approaches
Research article · Mar 2014
Privacy Preserving Outsourcing for Frequent Itemset Mining
Research article · 30 Jan 2017
FI-DBSCAN: Frequent Itemset Ultrametric Trees with Density Based Spatial Clustering Of Applications with Noise Using Mapreduce in Big Data
More from this journal
The newest in International Journal of Innovative Research in Computer and Communication Engineering.
Commentary · 2023
Computer Vision and Pattern Recognition
Commentary · 2023
Computer Network and Network Optimization
Perspective · 2023
Cloud Computing and Big Data Analysis
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Innovative Research in Computer and Communication Engineering
- SubjectComputer Science & IT
- SubjectEngineering
- SubjectSocial Sciences & Humanities
- BylineArticles whose byline prints “P.Subhashini”
- BylineArticles whose byline prints “Dr.G.Gunasekaran”
