增量式目标信息系统的分布约简算法  

DISTRIBUTION REDUCTION ALGORITHM FOR INCREMENTAL OBJECTIVE INFORMATION SYSTEM

作　　者：吴正江[1] 王希璠 

机构地区：[1]河南理工大学河南省高等学校矿山信息化重点学科开放实验室,河南焦作454003

出　　处：《计算机应用与软件》2015年第8期234-237,291,共5页Computer Applications and Software

基　　金：国家青年基金项目(61202286)

摘　　要：知识约简是粗糙集理论中的重要研究内容之一。由于静态分布约简算法不适应处理快速增长的信息系统,时间开销过大。通过研究新增对象对于信息系统中划分的影响,以划分为桥梁,讨论对象与分布约简的理论关系。基于已有的分布约简算法,提出增量式目标信息系统的分布约简算法,使其能够将原有知识和新增数据相结合,快速获取分布约简。使用UCI数据库中的数据集对算法进行测试,验证了该增量式算法的有效性和可行性。Knowledge reduction is one of the important research contents in rough set theory. Static distribution reduction algorithm is not adapted to dealing with the information system in rapid growth,and it is very time-consuming. Through studying the impact of newly incremented object on the division of information systems,we discussed the theoretical relationship between the objects and the distribution reduction by taking division as the bridge. Based on existing distribution reduction algorithm,we proposed the new distribution reduction algorithm for incremental object information system,made it to be able to combine the existing knowledge with newly incremented data,and to rapidly obtain the distribution reduction. The data sets downloaded from UCI databases was used to test the algorithm,it verified that the incremental algorithm is effective and feasible.

关 键 词：信息系统 分布约简 增量式算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]