Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse

DOI10.1016/J.COR.2005.01.026MaRDI QIDQ2499150zbMATH OpenOpenAlexFDO

Authors Chienwen Wu

Publication date 14 August 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.01.026

zbMATH Keywords

frequent itemset miningwarehousing

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90)

Recommendations

• A novel algorithm for frequent itemset mining in data warehouses
• An efficient procedure for mining statistically significant frequent itemsets
• Efficient association rule mining among both frequent and infrequent items
• scientific article; zbMATH DE number 1964830

Cites work

• A tree projection algorithm for generation of frequent item sets

Cited in

(3)

• A two-stage integer programming model considering transaction equivalence for privacy preservation
• Mining frequent itemsets: a perspective from operations research
• Synergies of operations research and data mining

This page was built for publication: Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse

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