Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Systematic parameterized complexity analysis in computational phonology
Systematic parameterized complexity analysis in computational phonology
Fast vertical mining using diffsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing
Approximating a collection of frequent sets
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
The complexity of mining maximal frequent itemsets and maximal frequent patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
| Hi-index | 0.00 |
A core problem in data mining is enumerating frequently-occurring itemsets in a given set of transactions. The search and enumeration versions of this problem have recently been proven NP- and #P-hard, respectively (Gunopulos et al, 2003) and known algorithms all have running times whose exponential terms are functions of either the size of the largest transaction in the input and/or the largest itemset in the output. In this paper, we analyze the complexity of the size-k frequent itemset enumeration problem relative to a variety of parameterizations. Many of our hardness results are proved using a recent extension of parameterized complexity to solution-counting problems (McCartin, 2002). These results include hardness for versions of this problem based on restricted transaction-set structure. We also derive a collection of fixed-parameter algorithms using off-the-shelf parameterized algorithm design techniques, several of which suggest new algorithmic directions for the frequent itemset enumeration problem.