This algorithm can generate new candidate item sets effectively using the frequent item sets in the knowledge database, so it can avoid the problem that candidate item sets is very large.

• 该算法可以有效利用知识数据库中保留的最小非高频项目集来产生新的候选项目集,避免了候选项目集的数量太庞大的问题。