171 search results - page 12 / 35 » Statistical Supports for Frequent Itemsets on Data Streams |
KDD
2010
ACM
15 years 3 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
131
click to vote
AICCSA
2008
IEEE
14 years 12 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...
101
click to vote
ISCIS
2004
Springer
15 years 5 months ago
2004
Springer
One of the classic data mining problems is discovery of frequent itemsets. This problem particularly attracts database community as it resembles traditional database querying. In t...
130
click to vote
DAMON
2008
Springer
15 years 1 months ago
2008
Springer
Frequent elements and top-k queries constitute an important class of queries for data stream analysis applications. Certain applications require answers for both frequent elements...
113
click to vote
KDD
2005
ACM
16 years 2 days ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...