Sciweavers

78 search results - page 1 / 16
» BIDE: Efficient Mining of Frequent Closed Sequences
Sort
View
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 6 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
16
Voted
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
13 years 6 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
13 years 2 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
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
FIMI
2004
279views Data Mining» more  FIMI 2004»
13 years 6 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...