Abstract: A lot of new problems maybe occur when considering both positive and negative association rules simultaneously. These problems include how to mine infrequent itemsets, how to avoid generating self-contradictory rules and so on. This paper studies these problems in details. Algorithms are proposed to mine frequent and infrequent itemsets and to mine positive and negative association rules in these itemsets. Experimental results demonstrate the algorithms are efficient.

摘要： 当同时研究正、负关联规则时会遇到一些新问题,如非频繁项集的挖掘及如何避免产生自相矛盾的规则等。该文对这些问题进行了深入的研究,设计了能够同时挖掘频繁项集与非频繁项集以及能够同时挖掘这些项集中的正、负关联规则算法,实验表明该算法是非常有效的。

关键词: 负关联规则, 非频繁项集, 相关性, 支持度, 置信度

CLC Number: 

• TP311.1