259 search results - page 20 / 52 » Mining frequent itemsets in time-varying data streams |
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
65
Voted
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
CLA
2007
14 years 11 months ago
2007
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
PAKDD
2010
ACM
14 years 8 months ago
2010
ACM
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
93
Voted
IEEEHPCS
2010
14 years 8 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...