Task-parallel FP-growth on cluster computers

DOI10.1007/978-90-481-9794-1_71MaRDI QIDQ4932747zbMATH OpenOpenAlexFDO

Authors Gülistan Özdemir Özdogan, Osman Abul

Publication date 6 October 2010

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-90-481-9794-1_71

zbMATH Keywords

data miningfrequent itemset mining

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1977850
• Towards more parallel frequent itemset mining algorithms
• scientific article; zbMATH DE number 1953317
• scientific article; zbMATH DE number 1863282
• Parallel sequence mining on shared-memory machines

Cited in

(4)

• Towards more parallel frequent itemset mining algorithms
• scientific article; zbMATH DE number 1953317 (Why is no real title available?)
• scientific article; zbMATH DE number 1977850 (Why is no real title available?)
• Parallel sequence mining on shared-memory machines

This page was built for publication: Task-parallel FP-growth on cluster computers

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