Frequent itemsets in data streams using dynamically generated minimum support

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We have presented an approach that generates frequent itemsets from data stream. The itemsets are compressed and then stored in the memory. The decision to whether or not compress an itemset is based on the utility of the itemset. In this chapter, the utility of an itemset is defined in terms of the amount of memory saved by its compression. Beside this, we have presented an approach to dynamically generate the value of minimum support threshold based on the data in the data streams. It avoids having a fixed minimum support threshold throughout the data stream. Since the value is generated from the latest elements in the data stream, it suits to be an appropriate measure to separate the frequent itemsets from the non-frequent ones.

Cite

CITATION STYLE

APA

Naik, S. B., & Pawar, J. D. (2019). Frequent itemsets in data streams using dynamically generated minimum support. In Advances in Intelligent Systems and Computing (Vol. 828, pp. 357–365). Springer Verlag. https://doi.org/10.1007/978-981-13-1610-4_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free