80 search results - page 3 / 16 » Approximate mining of frequent patterns on streams |
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
CIKM
2008
Springer
13 years 7 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...
PR
2007
13 years 4 months ago
2007
A data stream is a potentially uninterrupted flow of data. Mining this flow makes it necessary to cope with uncertainty, as only a part of the stream can be stored. In this pape...
MLDM
2009
Springer
13 years 12 months ago
2009
Springer
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
ICDM
2007
IEEE
13 years 9 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...