基于部分支持度树的关联规则增量式更新算法

Incremental updating algorithm of mining association rules based on partial support tree

关联规则挖掘是数据挖掘技术的一种简单又很实用的方法,有着广泛的应用。该文利用部分支持度树的结构提出了对关联规则的增量式更新算法,用于解决向数据库中添加新的数据而最小支持度不发生变化时的关联规则更新问题。该算法有效地利用已挖掘的关联规则和保留的部分支持度树来改善性能,并且只需对新增数据库部分进行一遍扫描,从而进一步提高算法的效率。实验结果表明,该算法能有效地解决关联规则的更新问题,提升挖掘效率。

Association rules mining is a simple and useful data mining method and has a wide range of application.A new algorithm based on partial support tree（PS_Tree） is proposed in this article for the purpose of dealing with the incremental updating problem when a new data is inserted in database and the minimum support is not changed.This algorithm uses effectively the association rules mined and the partial support tree constructed for a better performance.It needs scanning the updated part of the database only once,which can further improve efficiency.The performance study shows that the algorithm is an effective solution for incremental updating problems of association rules and can thus increase mining efficiency.