302 search results - page 2 / 61 » Efficient frequent pattern mining over data streams |
KDD
2008
ACM
14 years 5 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...
DIS
2009
Springer
13 years 12 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...
WWW
2006
ACM
14 years 6 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...
KAIS
2008
13 years 5 months ago
2008
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...