False-negative frequent items mining from data streams with bursting

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

Abstract

False-negative frequent items mining from a high speed transactional data stream is to find an approximate set of frequent items with respect to a minimum support threshold, s. It controls the possibility of missing frequent items using a reliability parameter 6. The importance of false-negative frequent items mining is that it can exclude falsepositives and therefore significantly reduce the memory consumption for frequent itemsets mining. The key issue of false-negative frequent items mining is how to minimize the possibility of missing frequent items. In this paper, we propose a new false-negative frequent items mining algorithm, called Loss-Negative, for handling bursting in data streams. The new algorithm consumes the smallest memory in comparison with other false-negative and false-positive frequent items algorithms. We present theoretical bound of the new algorithm, and analyze the possibility of minimization of missing frequent items, in terms of two possibilities, namely, in-possibility and out-possibility. The former is about how a frequent item can possibly pass the first pruning. The latter is about how long a frequent item can stay in memory while no occurrences of the item comes in the following data stream for a certain period. The new proposed algorithm is superior to the existing false-negative frequent items mining algorithms in terms of the two possibilities. We demonstrate the effectiveness of the new algorithm in this paper. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Chong, Z., Yu, J. X., Lu, H., Zhang, Z., & Zhou, A. (2005). False-negative frequent items mining from data streams with bursting. In Lecture Notes in Computer Science (Vol. 3453, pp. 422–434). Springer Verlag. https://doi.org/10.1007/11408079_38

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