Sciweavers

317 search results - page 25 / 64
» A hybrid approach to mining frequent sequential patterns
Sort
View
VLDB
2000
ACM
130views Database» more  VLDB 2000»
15 years 1 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han
KDD
2002
ACM
112views Data Mining» more  KDD 2002»
15 years 10 months ago
From run-time behavior to usage scenarios: an interaction-pattern mining approach
A key challenge facing IT organizations today is their evolution towards adopting e-business practices that gives rise to the need for reengineering their underlying software syst...
Mohammad El-Ramly, Eleni Stroulia, Paul G. Sorenso...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 10 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à
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
15 years 10 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
ADC
2008
Springer
156views Database» more  ADC 2008»
15 years 4 months ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang