Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori

MaRDI QIDQ5388489zbMATH OpenFDO

Authors Przemysław Grudziński, Marek Wojciechowski

Publication date 18 April 2012

Full work available at URL https://eudml.org/doc/209612, http://matwbn.icm.edu.pl/tresc.php?wyd=13&tom=38&jez=pl

zbMATH Keywords

Apriori algorithmdata miningdata mining queriesfrequent itemset mining

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Software, source code, etc. for problems pertaining to systems and control theory (93-04)

Recommendations

• Integration of dataset scans in processing sets of frequent itemset queries
• Frequent-itemset mining using locality-sensitive hashing
• Knowledge Discovery in Inductive Databases
• scientific article; zbMATH DE number 5967649
• scientific article; zbMATH DE number 5522675

Cited in

(2)

• Frequent-itemset mining using locality-sensitive hashing
• Integration of dataset scans in processing sets of frequent itemset queries

This page was built for publication: Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori

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