An efficient procedure for mining statistically significant frequent itemsets

DOI10.2298/PIM1001109SMaRDI QIDQ4899840zbMATH OpenOpenAlexFDO

Authors P. Stanisic, Savo Tomović

Publication date 10 January 2013

Published in Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/pim1001109s

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

a priori algorithmassociation analysisdata mining

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Logic in artificial intelligence (68T27)

Recommendations

• An improved algorithm based on sets operation for mining frequent itemsets
• scientific article; zbMATH DE number 2219521
• An efficient rigorous approach for identifying statistically significant frequent itemsets
• scientific article; zbMATH DE number 5967649
• A tree projection algorithm for generation of frequent item sets

Cited in

(5)

• Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse
• An improved algorithm based on sets operation for mining frequent itemsets
• scientific article; zbMATH DE number 1964830 (Why is no real title available?)
• An efficient rigorous approach for identifying statistically significant frequent itemsets
• A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets

This page was built for publication: An efficient procedure for mining statistically significant frequent itemsets

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