Computational complexity of queries based on itemsets

Authors:
Nikolaj Tatti
Affiliations:
HIIT Basic Research Unit, Laboratory of Computer and Information Science, Helsinki University of Technology, Finland
Venue:
Information Processing Letters
Year:
2006

Citing 9
Cited 5

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Probabilistic Satisfiability

Journal of Complexity
The computational complexity of probabilistic inference using Bayesian belief networks (research note)

Artificial Intelligence
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules

Advances in knowledge discovery and data mining
Probabilistic logic programming with conditional constraints

ACM Transactions on Computational Logic (TOCL)
Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data

IEEE Transactions on Knowledge and Data Engineering
Computational complexity of itemset frequency satisfiability

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Phase transitions of PP-complete satisfiability problems

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Decomposable Families of Itemsets

ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Probably the best itemsets

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Tell me what i need to know: succinctly summarizing data with itemsets

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Comparing apples and oranges: measuring differences between data mining results

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Summarizing data succinctly with the most informative itemsets

ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011

Quantified Score

Hi-index	0.89

Visualization

Abstract

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.