583 search results - page 24 / 117 » Mining evolving data streams for frequent patterns |
103
click to vote
PKDD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
PAKDD
2007
ACM
15 years 3 months ago
2007
ACM
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
93
Voted
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...
82
Voted
ACMSE
2009
ACM
15 years 4 months ago
2009
ACM
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...