【摘要】 关联规则的挖掘是一个重要的数据挖掘问题 ,在关联规则的挖掘过程中加入约束条件 ,是实现用户参与挖掘的一种方式 .在有约束的关联规则挖掘过程中 ,用户会不断调整约束条件 ,并要求更新挖掘结果 .针对这种情况 ,提出了约束关联规则的增量式维护算法 Separate M,当约束条件发生变化时 ,在原有挖掘结果的基础上实现增量式更新 ,较重新运行 Separate算法而言 ,减小了搜索空间 ,节约了时间 ,提高了挖掘效率更多还原

【Abstract】 Mining of the association rules is an important issue in the data mining field.In the process of mining association rules,users may add constraints.In fact this has been a way for users to interact with mining process, During this process,constraints may be changed constantly and users always demand the update of the mining result according to the changed constraints. Aimed at this problem, an incremental algorithm, named Separate M , for maintaining constrained association rules is presented. It can use information from the last mining process and avoid running the Separate algorithm over again. In this way, the time can be shortened and the efficiency of data mining process can be improved.更多还原