Aiming at the problem of mining repetition in decremental mining, based on closed sequential pattern PosD*, a decremental algorithm of DePosD* is presented, which has better time efficiency. This algorithm gets the new result by moving the data between the frequent and non-frequent closed sequence, directly decreasing and uqdating the original mining result. Thus it saves time, which has proven by the experiment.%针对数据库减量时不断重复挖掘的问题,在已有闭合序列模式算法PosD*的基础上,提出一种减量挖掘算法DePosD*.通过移动频繁和非频繁闭合序列集合之间的数据,在原有挖掘结果上直接进行更新,减少挖掘的时间.实验结果证明,在减最过程中该算法的时间效率与PosD*相比有所提高.
展开▼