EFFICIENT TECHNIQUE FOR MINING FREQUENT PATTERNS OVER DATA STREAM
Author(s):
NIYATI M. MEVADA, JAYNA B. SHAH
Keywords:
frequent itemsets , data stream
Abstract
Mining frequent items is one of the most important research topics in data mining. In existing system an effective bit-sequence based, one-pass algorithm, called MFI-Trans-SW (Mining Frequent Itemsets within a Transaction Sliding Window), to mine the set of frequent itemsets from data streams within a transaction sliding window which consists of a fixed number of transactions. MFI-TransSW algorithm consists of three phases: window initialization, window sliding and pattern generation. The existing system mines the frequent patterns for the recent data only . In proposed system, we are going to mine the frequent patterns for overall all data. Even the historical data is useful when frequent patterns are mined. As soon as the transaction arrives , each incoming transaction is scanned . If the itemset exist in the transaction the support count is incremented by 1. Otherwise the support count would remain same as it was. Frequent as well as infrequent patterns are maintained in the system. The proposed system not only attain highly accurate mining results, but also run significant faster than existing algorithms for mining frequent itemsets from data streams without using a sliding window.
Article Details
Unique Paper ID: 143786

Publication Volume & Issue: Volume 3, Issue 1

Page(s): 377 - 382
Article Preview & Download


Share This Article

Go To Issue



Call For Paper

Volume 7 Issue 3

Last Date 25 August 2020

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews

Contact Details

Telephone:6351679790
Email: editor@ijirt.org
Website: ijirt.org

Policies