Computational aspects of mining maximal frequent patterns
From MaRDI portal
Publication:2508965
Recommendations
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?)
- Introduction to algorithms
- NP-completeness: a retrospective
- On the complexity of generating maximal frequent and minimal infrequent sets
- On-line construction of suffix trees
- Optimized substructure discovery for semi-structured data
- 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
- Complexity analysis of depth first and FP-growth implementations of APRIORI
- On the complexity of generating maximal frequent and minimal infrequent sets
- The Complexity of Mining Maximal Frequent Subgraphs
- scientific article; zbMATH DE number 2217745 (Why is no real title available?)
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)