112 search results - page 3 / 23 » Efficient Approximate Mining of Frequent Patterns over Trans... |
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
JIIS
2007
13 years 4 months ago
2007
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
KDD
2003
ACM
14 years 5 months ago
2003
ACM
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...