5 search results - page 1 / 1 » CLOSET : searching for the best strategies for mining freque... |
KDD
2003
ACM
14 years 4 months ago
2003
ACM
SDM
2004
SIAM
13 years 5 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
KAIS
2008
13 years 4 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
KDD
2007
ACM
13 years 10 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...