Parallel FP-growth on PC cluster

DOI10.1007/3-540-36175-8_47MaRDI QIDQ4424047zbMATH OpenFDO

Authors Iko Pramudiono, Masaru Kitsuregawa

Publication date 9 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2637/26370467.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Task-parallel FP-growth on cluster computers
• Parallel tree projection algorithm for sequence mining
• Towards more parallel frequent itemset mining algorithms
• Parallel sequence mining on shared-memory machines
• Fast FP-growth for association rule mining

Cited in

(4)

• A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network
• Towards more parallel frequent itemset mining algorithms
• An efficient parallel and distributed algorithm for counting frequent sets
• Task-parallel FP-growth on cluster computers

This page was built for publication: Parallel FP-growth on PC cluster

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