388 search results - page 17 / 78 » Mining Frequent Itemsets Using Support Constraints |
SDM
2003
SIAM
13 years 8 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, ...
PAKDD
2005
ACM
14 years 1 months ago
2005
ACM
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
JCST
2008
13 years 7 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
JIIS
2008
13 years 7 months ago
2008
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
IS
2010
13 years 6 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...