Sciweavers

34 search results - page 2 / 7
» Recursion Pruning for the Apriori Algorithm
Sort
View
ICASSP
2009
IEEE
13 years 9 months ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 6 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
CIKM
2008
Springer
13 years 7 months ago
Pruning nested XQuery queries
We present in this paper an approach for XQuery optimization that exploits minimization opportunities raised in composition-style nesting of queries. More precisely, we consider t...
Bilel Gueni, Talel Abdessalem, Bogdan Cautis, Emma...
DGO
2004
80views Education» more  DGO 2004»
13 years 6 months ago
Temporal Knowledge Discovery with Infrequent Episodes
In this paper, we present an efficient algorithm which discovers rare episodes with a combination of bottomup and top-down scanning schema. The information sharing between bottom-...
Dan Li, Liying Jiang, Jitender S. Deogun
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 5 days ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou