80 search results - page 5 / 16 » Approximate mining of frequent patterns on streams |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
WWW
2006
ACM
14 years 8 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...
IDEAL
2007
Springer
14 years 1 months ago
2007
Springer
Frequent disjunctive pattern is known to be a sophisticated method of text mining in a single document that satisfies anti-monotonicity, by which we can discuss efficient algorith...
DATAMINE
2006
13 years 7 months ago
2006
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...