|
Title
|
|
|
|
Mining frequent itemsets in a stream
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency over all possible windows in the stream from any point in the past until the current state that satisfy a minimal length constraint. Properties of this new measure are studied and an incremental algorithm that allows, at any time, to immediately produce the current frequencies of all frequent itemsets is proposed. Experimental and theoretical analysis show that the space requirements for the algorithm are extremely small for many realistic data distributions. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
Proceedings. - Los Alamitos, Calif, 2001, currens
| |
|
Source (book)
|
|
|
|
Proceedings of the IEEE International Conference on Data Mining 2007
| |
|
Publication
|
|
|
|
Los Alamitos, Calif.
:
IEEE Computer Society
,
2007
| |
|
ISSN
|
|
|
|
1550-4786
| |
|
ISBN
|
|
|
|
978-0-7695-3018-5
| |
|
Volume/pages
|
|
|
|
(2007)
, p. 83-92
| |
|
ISI
|
|
|
|
000253429400009
| |
|