Sciweavers

78 search results - page 3 / 16
» BIDE: Efficient Mining of Frequent Closed Sequences
Sort
View
WWW
2008
ACM
14 years 8 months ago
Efficient mining of frequent sequence generators
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
Chuancong Gao, Jianyong Wang, Yukai He, Lizhu Zhou
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
IDA
2009
Springer
13 years 5 months ago
Efficient Vertical Mining of Frequent Closures and Generators
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
DAWAK
2004
Springer
13 years 11 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin