Mining frequent itemsets: a perspective from operations research
From MaRDI portal
Publication:6573277
DOI10.1111/J.1467-9574.2010.00452.XMaRDI QIDQ6573277FDOQ6573277
Authors: Wim Pijls, Walter A. Kosters
Publication date: 16 July 2024
Published in: Statistica Neerlandica (Search for Journal in Brave)
Cites Work
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of computing the permanent
- Backtrack Programming
- Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse
- Title not available (Why is that?)
This page was built for publication: Mining frequent itemsets: a perspective from operations research
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573277)