The Parameterized Complexity of Enumerating Frequent Itemsets

DOI10.1007/11847250_21zbMATH Open1154.68427OpenAlexW1542019904MaRDI QIDQ3499740FDOQ3499740

Authors: Matthew B. Hamilton, Rhonda Chaytor, Todd Wareham 

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

Recommendations

• Computational aspects of mining maximal frequent patterns
• Itemset frequency satisfiability: complexity and axiomatization
• The complexity of satisfying constraints on databases of transactions
• The Complexity of Mining Maximal Frequent Subgraphs
• scientific article; zbMATH DE number 2217745

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Database theory (68P15)

Cited In (4)

• Linear-time algorithm for generating c-isolated bicliques
• The complexity of satisfying constraints on databases of transactions
• Itemset frequency satisfiability: complexity and axiomatization
• A parameterizable enumeration algorithm for sequence mining

This page was built for publication: The Parameterized Complexity of Enumerating Frequent Itemsets

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