127 search results - page 5 / 26 » Approximately Mining Recently Representative Patterns on Dat... |
ICDM
2008
IEEE
14 years 22 days ago
2008
IEEE
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
SIGMOD
2004
ACM
14 years 6 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...
PAKDD
2004
ACM
13 years 11 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
WWW
2006
ACM
14 years 7 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...
KDD
2008
ACM
14 years 6 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...