Enhancing the \textit{apriori} algorithm for frequent set counting

DOI10.1007/3-540-44801-2_8MaRDI QIDQ4535561zbMATH OpenFDO

Authors Salvatore Orlando, Paolo Palmerini, Raffaele Perego

Publication date 16 June 2002

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/2114/21140071

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 5967649
• An enhancement for apriori algorithm
• An improved algorithm based on sets operation for mining frequent itemsets
• An improvement of data mining apriori technique
• An improved algorithm of Apriori

Cited in

(3)

• Meta itemset: a new concise representation of frequent itemset
• scientific article; zbMATH DE number 1953317 (Why is no real title available?)
• An enhancement for apriori algorithm

This page was built for publication: Enhancing the \textit{apriori} algorithm for frequent set counting

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