现有的关联规则挖掘方法中，大多采用单一的最小支持度。
The single minimum support degree is used in the existing association rules mining methods mostly.
如何实现不同最小支持度下频繁项目集的更新就显得尤为重要。
The process of discovering frequent itemsets is a problem of the high cost, and how do we complete the updated frequent itemsets under a new minimum support is obviously important.
然后对该事务集进行数据挖掘，找出所有的满足最小支持度的类别关联规则。
Then mine the set and get all frequent class association rules that satisfy the minimum support.
应用推荐