最大值约束下的多最小支持度关联规则挖掘

Mining Association Rules with Multiple Minimum Supports Using Maximum Constraints

在以前的算法中对于所有的项目或者是项目集合都是使用单一的最小支持度。但是在实际的应用中,不同的项目就需要不同的最小支持度。提出一个简单的算法,根据Apri-ori算法在最大值约束条件下来找到最大项集和关联规则,并且根据Ming-Cheng Tseng中提出的confidence-lift模式得出有兴趣的关联规则。

Most of the previous approaches set a single minimum support threshold for all the items or itemsets. But in real applications, different items may have different criteria to judge its importance. Proposes a simple algorithm based on the Apriori approach to find the largeitemsets and association rules under this constraint, then gets the interesting association rules using confidence-lift pattern.