An efficient parallel and distributed algorithm for counting frequent sets

DOI10.1007/3-540-36569-9_28MaRDI QIDQ4414789zbMATH OpenFDO

Authors Salvatore Orlando, Paolo Palmerini, Raffaele Perego, Fabrizio Silvestri

Publication date 27 July 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/2565/25650421.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Towards more parallel frequent itemset mining algorithms
• Task-parallel FP-growth on cluster computers
• Parallel sequence mining on shared-memory machines
• Enhancing the \textit{apriori} algorithm for frequent set counting
• Parallel FP-growth on PC cluster

Cited in

(5)

• A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
• Integration of dataset scans in processing sets of frequent itemset queries
• Towards more parallel frequent itemset mining algorithms
• Task-parallel FP-growth on cluster computers
• Investigation of supports counting based on multi-level bitmap catalogue

This page was built for publication: An efficient parallel and distributed algorithm for counting frequent sets

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