【摘要】 频繁项目集是满足最小支持度和最小置信度下的一个项目集合,但随着最小支持度的不同,就会产生不同的频繁项目集,而频繁项目集的发现又是一个高花费的过程.该文提出一个新的维护算法,用来解决关联规则的更新维护问题.更多还原

【Abstract】 The frequent itemsets are a set of all items that satisfy a minimum support and a minimum confidence. With the variance of the minimum support, there are the different frequent itemsets. The process of discovering frequent itemsets is a problem of the high cost. In this paper, one new maintenance algorithm is presented for the efficient maintenance problem of association rules.更多还原