alexa An Efficient Sequential Frequent Pattern Analysis Usin
ISSN ONLINE(2319-8753)PRINT(2347-6710)

International Journal of Innovative Research in Science, Engineering and Technology
Open Access

Like us on: https://twitter.com/ijirset_r
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

An Efficient Sequential Frequent Pattern Analysis Using DBCA

K.Sasikala 1, P.Velusamy 2
  1. P.G. Student, Department of Computer Science and Engineering, Sengunthar Engineering College, Tiruchengode, Tamilnadu, India
  2. Assistant Professor, Department of Computer Science and Engineering, Sengunthar Engineering College, Tiruchengode, Tamilnadu, India
Related article at Pubmed, Scholar Google
 
To read the full article Peer-reviewed Article PDF image

Abstract

In this work, the practical problem of frequent-itemset discovery in data-stream environments which may suffer from data overload. The main issues include frequent-pattern mining and data-overload handling. Therefore, a mining algorithm together with Separate dedicated overload-handling mechanisms is proposed. The algorithm DBCA (Dynamic Base Combinatorial Algorithm) extracts basic information from streaming data and keeps the information in its data structure. The DBCA algorithm extracts base information from data streams in a dynamic way. More specifically, it keeps base information on a data stream with the size concerning the average length n of transactions. It could effectively manage data overload with the overload-handling mechanisms. Our results may leads to a possible solution for sequential frequent-pattern mining in dynamic streams, the Sliding window by pruning the excess of incoming data and dealing only with the trimmed data, not by processing on the full amount of incoming data. Depending on how overloading data can be trimmed, there may be various policies on load shedding, and we have described three such policies. The proposed policies, although possess different properties, have all been verified by the experiment to be effective.

Keywords

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