Sciweavers

26 search results - page 1 / 6
» An Efficient Algorithm for Mining Frequent Sequences by a Ne...
Sort
View
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 5 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
13 years 9 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
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 5 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
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...
Jianyong Wang, Jiawei Han
JCST
2008
119views more  JCST 2008»
13 years 4 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
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 ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
JCIT
2010
174views more  JCIT 2010»
12 years 11 months ago
Efficient Ming of Top-K Closed Sequences
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...
Panida Songram