313 search results - page 24 / 63 » Mining Frequent Itemsets in a Stream |
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...
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...
72
Voted
CIDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In this paper we have proposed an improved approach to extract rare association rules. Rare association rules are the association rules containing rare items. Rare items...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...