Computational aspects of mining maximal frequent patterns

DOI10.1016/J.TCS.2006.05.029MaRDI QIDQ2508965zbMATH OpenOpenAlexFDO

Authors Guizhen Yang

Publication date 20 October 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.05.029

zbMATH Keywords

\#P-completecomplexitydata miningmaximal frequent patterns

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2217745
• A mining algorithm for fast maximal sequential patterns
• The Complexity of Mining Maximal Frequent Subgraphs
• Frequent Pattern Mining
• scientific article; zbMATH DE number 1983139

Cites work

• Complete mining of frequent patterns from graphs: Mining graph data
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 33703 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1934539 (Why is no real title available?)
• scientific article; zbMATH DE number 2086380 (Why is no real title available?)
• Introduction to algorithms
• NP-completeness: a retrospective
• On-line construction of suffix trees
• Ordered and Unordered Tree Inclusion
• Recognition and parsing of context-free languages in time n3
• SPADE: An efficient algorithm for mining frequent sequences
• Subtree Isomorphism in O(n5/2)
• The complexity of computing the permanent
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The complexity of counting in sparse, regular, and planar graphs
• The Complexity of Enumeration and Reliability Problems
• The Complexity of Planar Counting Problems

Cited in

(6)

• Upper bound on the size of FP-tree
• The Parameterized Complexity of Enumerating Frequent Itemsets
• scientific article; zbMATH DE number 2013276 (Why is no real title available?)
• scientific article; zbMATH DE number 2086380 (Why is no real title available?)
• The Complexity of Mining Maximal Frequent Subgraphs
• scientific article; zbMATH DE number 2217745 (Why is no real title available?)

Describes a project that uses

Uses Software

• SPADE
• gSpan
• CLOSET
• CloseGraph

This page was built for publication: Computational aspects of mining maximal frequent patterns

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