22 search results - page 3 / 5 » Mining top-k frequent items in a data stream with flexible s... |
ICDM
2006
IEEE
13 years 10 months ago
2006
IEEE
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
CIKM
2009
Springer
13 years 8 months ago
2009
Springer
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
PODC
2006
ACM
13 years 10 months ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
AUSDM
2007
Springer
13 years 10 months ago
2007
Springer
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...