263 search results - page 11 / 53 » kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets |
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
AUSAI
2003
Springer
15 years 2 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
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...
MDAI
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we introduce a diamond episode of the form s1 → E → s2, where s1 and s2 are events and E is a set of events. The diamond episode s1 → E → s2 means that every...