Computational aspects of mining maximal frequent patterns

DOI10.1016/j.tcs.2006.05.029zbMath1100.68021OpenAlexW2108697621MaRDI QIDQ2508965

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

complexitydata mining\#P-completemaximal frequent patterns

Mathematics Subject Classification ID

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

Uses Software

• SPADE
• gSpan
• CLOSET
• CloseGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Complete mining of frequent patterns from graphs: Mining graph data
• On-line construction of suffix trees
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Enumeration and Reliability Problems
• Subtree Isomorphism in O(n5/2)
• The Complexity of Planar Counting Problems
• NP-completeness: A retrospective
• Ordered and Unordered Tree Inclusion
• Recognition and parsing of context-free languages in time n3
• SPADE: An efficient algorithm for mining frequent sequences