提出了一种新的量化关联规则挖掘算法QAR及其增量式更新算法IUQAR。
A novel algorithm, QAR, for mining quantitative association rules and an incremental updating algorithm, IUQAR, are proposed.
针对负荷预测过程中样本数据是滚动更新的特点，在RAPHF的基础上提出了具有动态挖掘能力的粗糙集增量算法raphf - I。
On the basis of RAPHF, a rough set incremental algorithm with dynamic mining ability, namely, RAPHF-I is proposed by considering the updating samples.
该文主要对移动日志数据库不断更新的问题，提出了增量挖掘的方法，挖掘用户的移动模式。
An incremental mining technique is proposed in order to solve the problem of frequent updating of moving log database and mine the user mobility patterns.
通过对挖掘关联规则增量更新中FUP算法的关键思想以及性能进行了研究，提出了改进的FUP算法SFUP。
An improved incremental updating algorithm SFUP is developed based on study of the principle and efficiency of FUP algorithm.
但是，如果在数据库更新之后要对全部数据重新进行挖掘，需要消耗大量的资源，这导致对增量挖掘算法的迫切需求。
But, if we need recalculate rules from all data to mine knowledge after updating the database, it will consume massive resources, which causes the urgent demand of the incremental mining algorithm.
但是，如果在数据库更新之后要对全部数据重新进行挖掘，需要消耗大量的资源，这导致对增量挖掘算法的迫切需求。
But, if we need recalculate rules from all data to mine knowledge after updating the database, it will consume massive resources, which causes the urgent demand of the incremental mining algorithm.
应用推荐