IR @ Goa University

A quick algorithm for incremental mining closed frequent itemsets over data streams

A quick algorithm for incremental mining closed frequent itemsets over data streams

Naik, S.B.; Pawar, J.D.
Source : Proc. 2. ACM IKDD Conference on Data Sciences (CoDS '15). ACM. 2015; 126-127.
URI: http://dx.doi.org/10.1145/2732587.2732611
http://irgu.unigoa.ac.in/drs/handle/unigoa/4096
Date: 2015
Document Type: Conference article

Abstract:

An efficient algorithm QMINE to find closed frequent itemsets over a data stream is proposed. Our approach performs a few operations. Experiments have shown that our approach outperforms the previous approaches, significantly.

Show full item record

Files in this item

Thumbnail
Name: CoDS-15_ACM-2015_ ...
Size: 671.0Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Search IR


Advanced Search

Browse

My Account