112 search results - page 7 / 23 » Efficient Approximate Mining of Frequent Patterns over Trans... |
174
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
118
click to vote
AICCSA
2008
IEEE
14 years 9 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
83
Voted
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
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...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...