15 search results - page 2 / 3 » Deducing Bounds on the Support of Itemsets |
ADC
2008
Springer
14 years 1 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...
ICDM
2010
IEEE
13 years 4 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...
ICDM
2005
IEEE
14 years 8 days ago
2005
IEEE
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
ICDT
2009
ACM
14 years 7 months ago
2009
ACM
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...