112 search results - page 5 / 23 » Efficient Approximate Mining of Frequent Patterns over Trans... |
WWW
2006
ACM
15 years 10 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...
117
click to vote
DAWAK
2006
Springer
15 years 1 months 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 ...
ICDM
2007
IEEE
15 years 1 months ago
2007
IEEE
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
ICDM
2007
IEEE
15 years 1 months ago
2007
IEEE
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
106
click to vote
ADC
2003
Springer
15 years 2 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...