alexa Abstract | An Efficient Algorithm for Finding the Support Count of Frequent 1-Itemsets in Frequent Pattern Mining
ISSN ONLINE(2320-9801) PRINT (2320-9798)

International Journal of Innovative Research in Computer and Communication Engineering
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article Open Access

Abstract

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.

To read the full article Peer-reviewed Article PDF image

Author(s): P.Subhashini, Dr.G.Gunasekaran

Keywords

Frequent Itemsets, support count, Frequent 1-itemsets., Autonomic and Context Aware Computing,Bioinformatics and Computational Biology,Broadband and Intelligent Networks,Calm Technology,CDMA/GSM Communication Protocol

Share This Page

Additional Info

Loading
Loading Please wait..
 
 
Peer Reviewed Journals
 
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
 
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

 
© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version
adwords