148 search results - page 19 / 30 » Mining top-K frequent itemsets from data streams |
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
FIMI
2003
13 years 10 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
PAKDD
2010
ACM
13 years 7 months ago
2010
ACM
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...