Sciweavers

252 search results - page 7 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
DAWAK
2003
Springer
14 years 1 months ago
Comprehensive Log Compression with Frequent Patterns
In this paper we present a comprehensive log compression (CLC) method that uses frequent patterns and their condensed representations to identify repetitive information from large ...
Kimmo Hätönen, Jean-François Boul...
JCST
2008
119views more  JCST 2008»
13 years 7 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
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 9 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
KDD
2008
ACM
217views Data Mining» more  KDD 2008»
14 years 8 months ago
Stream prediction using a generative model based on frequent episodes in event sequences
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
Srivatsan Laxman, Vikram Tankasali, Ryen W. White