The Parameterized Complexity of Enumerating Frequent Itemsets
From MaRDI portal
Publication:3499740
DOI10.1007/11847250_21zbMath1154.68427OpenAlexW1542019904MaRDI QIDQ3499740
Matthew B. Hamilton, Todd Wareham, Rhonda Chaytor
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_21
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Combinatorics in computer science (68R05)
Related Items (1)
This page was built for publication: The Parameterized Complexity of Enumerating Frequent Itemsets