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

dc.contributor.author	Naik, S.B.
dc.contributor.author	Pawar, J.D.
dc.date.accessioned	2015-09-29T06:50:50Z
dc.date.available	2015-09-29T06:50:50Z
dc.date.issued	2015
dc.identifier.citation	Proc. 2. ACM IKDD Conference on Data Sciences (CoDS '15). ACM. 2015; 126-127.	en_US
dc.identifier.uri	http://dx.doi.org/10.1145/2732587.2732611
dc.identifier.uri	http://irgu.unigoa.ac.in/drs/handle/unigoa/4096
dc.description.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.
dc.subject	Computer Science and Technology	en_US
dc.title	A quick algorithm for incremental mining closed frequent itemsets over data streams	en_US
dc.type	Conference article	en_US