The Parameterized Complexity of Enumerating Frequent Itemsets

DOI10.1007/11847250_21MaRDI QIDQ3499740zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(4)

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

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)