Towards more parallel frequent itemset mining algorithms

MaRDI QIDQ3619341zbMATH OpenFDO

Authors Robert Kessl, Pavel Tvrdík

Publication date 3 April 2009

zbMATH Keywords

data miningfrequent itemset miningload balancingparallel algorithms and architectures

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Task-parallel FP-growth on cluster computers
• Parallel sequence mining on shared-memory machines
• scientific article; zbMATH DE number 1953317
• scientific article; zbMATH DE number 1977850
• scientific article; zbMATH DE number 1863282

Cited in

(6)

• A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
• Frequent pattern mining from high-dimensional data using record space search
• scientific article; zbMATH DE number 1953317 (Why is no real title available?)
• scientific article; zbMATH DE number 1977850 (Why is no real title available?)
• Task-parallel FP-growth on cluster computers
• \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures

This page was built for publication: Towards more parallel frequent itemset mining algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3619341)