Integration of dataset scans in processing sets of frequent itemset queries

DOI10.1007/978-3-642-23166-7_9MaRDI QIDQ3113393zbMATH OpenOpenAlexFDO

Authors Marek Wojciechowski, Maciej Zakrzewicz, Paweł Boinski

Publication date 9 February 2012

Published in Intelligent Systems Reference Library (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23166-7_9

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori
• Knowledge Discovery in Inductive Databases
• Constraint-Based Mining and Inductive Databases
• scientific article; zbMATH DE number 2217745
• An efficient parallel and distributed algorithm for counting frequent sets

Cited in

(3)

• Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori
• Constraint-Based Mining and Inductive Databases
• Knowledge Discovery in Inductive Databases

This page was built for publication: Integration of dataset scans in processing sets of frequent itemset queries

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