Sciweavers

2 search results - page 1 / 1
» RP-growth: Top-k Mining of Relevant Patterns with Minimum Su...
Sort
View
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 2 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
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...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
SDM
2012
SIAM
293views Data Mining» more  SDM 2012»
11 years 11 months ago
RP-growth: Top-k Mining of Relevant Patterns with Minimum Support Raising
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...
Yoshitaka Kameya, Taisuke Sato