Sciweavers

248 search results - page 25 / 50
» Mining Compressing Sequential Patterns
Sort
View
DAWAK
2009
Springer
14 years 11 days ago
TidFP: Mining Frequent Patterns in Different Databases with Transaction ID
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
C. I. Ezeife, Dan Zhang
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 25 days ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 10 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan
ALMOB
2006
102views more  ALMOB 2006»
13 years 8 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 9 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth