中文摘要：

关联规则近年来受到了广大学者多方面研究，计算冗余度过高、最小单约束、最大支持度和置信度阈值是关联规则中重要的急需优化问题。针对传统关联规则挖掘方法存在计算冗余度过高的问题，提出一种后处理闭包算子最小单约束的关联规则算法。首先，提出基于闭包算子约束规则等价关系集的关联规则挖掘方法，能够有效满足上述最小单约束、最大支持度和置信度阈值，并可有效将约束规则集划分为不相交的等价规则类；其次，给出问题解和特定规则类存在的充分必要条件，可有效降低算法冗余计算，提高算法计算效率；最后，通过在标准测试集上的实验对比，验证了所提算法的有效性，证明了算法运行的高效性。

英文摘要：

A method for association rule algorithm of the minimum single constraint of post processing closure op- erator is put forward. Firstly, association rule mining algorithm is proposed based on set of equivalence relation of constraint rule of closure operator. The algorithm can satisfy the minimum single constraint, the maximum support de- gree and confidence threshold effectively, and the set of constraint rule is divided into disjoint equivalence rule class. Then, the necessary and sufficient conditions of existent of problem solution and specific rule class are provided. It reduces redundancy computation of algorithm effectively and improves calculation efficiency. Finally, the effectiveness and high efficiency of the algorithm are verified via experiment comparison in set of normative testing.