47 search results - page 1 / 10 » Online mining of frequent query trees over XML data streams |
97
Voted
WWW
2006
ACM
16 years 1 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...
129
Voted
KDD
2008
ACM
16 years 1 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...
97
Voted
ICDM
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured data and patterns as labeled ordered trees, w...
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
123
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...