583 search results - page 3 / 117 » Mining evolving data streams for frequent patterns |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
IDA
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
DAWAK
2006
Springer
14 years 6 days ago
2006
Springer
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
WWW
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...