Computational Complexity of Queries Based on Itemsets
arXiv:1902.00633 · doi:10.1016/j.ipl.2006.02.003
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.
Cited by in corpus (5)
- Maximum Entropy Based Significance of Itemsets
- Summarizing Data Succinctly with the Most Informative Itemsets
- Comparing Apples and Oranges: Measuring Differences between Exploratory Data Mining Results
- Association Rule Mining using Maximum Entropy
- Interactive and Iterative Discovery of Entity Network Subgraphs