本文提出了一个基于模式分解树,不需要扫描原数据库的增量挖掘算法。
The paper presents an algorithm for incremental mining which is based on pattern decomposing tree and has no need for scanning old data base.
但是,如果在数据库更新之后要对全部数据重新进行挖掘,需要消耗大量的资源,这导致对增量挖掘算法的迫切需求。
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.
本文主要研究基于粗集的增量算法的数据挖掘系统。
This paper research a data mining system based on incremental updating algorithms of rough set theory.
应用推荐