2 search results - page 1 / 1 » RP-growth: Top-k Mining of Relevant Patterns with Minimum Su... |
ICDM
2002
IEEE
14 years 2 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...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
One practical inconvenience in frequent pattern mining is that it often yields a flood of common or uninformative patterns, and thus we should carefully adjust the minimum suppor...