14 search results - page 1 / 3 » Mining Top-K Frequent Closed Patterns without Minimum Suppor... |
ICDM
2002
IEEE
15 years 3 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...
ICDM
2003
IEEE
15 years 4 months ago
2003
IEEE
Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the min...
100
click to vote
JCIT
2010
14 years 5 months ago
2010
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
210
click to vote
ICDE
2004
IEEE
16 years 5 days ago
2004
IEEE
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
AAAI
2006
15 years 6 days ago
2006
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...