74 search results - page 6 / 15 » The complexity of mining maximal frequent itemsets and maxim... |
ADC
2008
Springer
14 years 2 months ago
2008
Springer
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
DKE
2007
13 years 7 months ago
2007
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
IDA
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
AICCSA
2008
IEEE
13 years 8 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...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall}...