The complexity of satisfying constraints on databases of transactions

Authors:
Toon Calders
Affiliations:
Eindhoven University of Technology, Department of Mathematics and Computer Science, Den Dolech 2, 5600 MB, Eindhoven, The Netherlands and University of Antwerp, Department of Mathematics an ...
Venue:
Acta Informatica
Year:
2007

Citing 0
Cited 3

An anytime deduction algorithm for the probabilistic logic and entailment problems

International Journal of Approximate Reasoning
Count constraints and the inverse OLAP problem: definition, complexity and a step toward aggregate data exchange

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs

ACM Transactions on Knowledge Discovery from Data (TKDD)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some itemset–interval pairs, does there exist a database such that for every pair, the frequency of the itemset falls in the interval? In this paper, we extend this FREQSAT-problem by further constraining the database by giving other characteristics as part of the input as well. These characteristics are the maximal transaction length, the maximal number of transactions, and the maximal number of duplicates of a transaction. These extensions and all their combinations are studied in depth, and a hierarchy w.r.t. complexity is given. To make a complete picture, also the cases where the characteristics are constant; i.e., bounded and the bound being a fixed constant that is not a part of the input, are studied.