Itemset mining is one of the most studied tasks in knowledge discovery. In this paper we analyze the computational complexity of three central itemset mining problems. We prove that mining confident rules with a given item in the head is NP-hard. We prove that mining high utility itemsets is NP-hard. We finally prove that mining maximal or closed itemsets is coNP-hard as soon as the users can specify constraints on the kind of itemsets they are interested in.

翻译：项定采矿是知识发现中研究最多的一项任务。 在本文中, 我们分析三个中央项定采矿问题的计算复杂性。 我们证明, 一项特定项目头部的采矿自信规则是NP硬的。 我们证明, 高用途物品的采矿是NP硬的。 我们最后证明, 只要用户能够明确他们感兴趣的物品种类的限制因素, 最大或封闭的采矿物品是CONP硬的。