259 search results - page 35 / 52 » Mining frequent itemsets in time-varying data streams |
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
107
click to vote
SDM
2011
SIAM
14 years 15 days ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
72
Voted
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
64
Voted
FIMI
2004
14 years 11 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured data and patterns as labeled ordered trees, w...