ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

TIFIM: Tree based Incremental Frequent Itemset Mining over Streaming Data

Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.10, No. 5)

Publication Date:

Authors : ; ; ;

Page : 1580-1586

Keywords : Data Mining; Data Streams; Frequent itemset; Frequent Itemset Mining; Data Stream Mining;

Source : Download Find it from : Google Scholarexternal

Abstract

Data Stream Mining algorithms performs under constraints called space used and time taken, which is due to the streaming property. The relaxation in these constraints is inversely proportional to the streaming speed of the data. Since the caching and mining the streaming-data is sensitive, here in this paper a scalable, memory efficient caching and frequent itemset mining model is devised. The proposed model is an incremental approach that builds single level multi node trees called bushes from each window of the streaming data; henceforth we refer this proposed algorithm as a Tree (bush) based Incremental Frequent Itemset Mining (TIFIM) over data streams.

Last modified: 2016-06-29 19:01:10