基于Rough集理论的Self集的构造和演化算法  

Construction and Evolutionary Algorithm of Self Sets Based on Rough Sets Theory

作　　者：符海东[1] 李春香[1] 

机构地区：[1]武汉科技大学计算机学院,湖北武汉430081

出　　处：《计算机技术与发展》2007年第12期60-63,67,共5页Computer Technology and Development

基　　金：湖北省教育重点科研项目基金(2004D006)

摘　　要：提出了一种基于Rough集理论的Self集构造和演化算法。利用Rough集约简算法,对用户的安全访问行为的数据作规范化处理并进行约简,从中提取有效的最简规则,降低了安全数据的冗余,减轻了特征码构造的负担。使用Rough集上、下近似集原理,构造了上、下近似Self集,实现了Self的优化和扩展,有效地解决了Self集的自动演化问题。A construction and evolution algorithm of Self sets based on the rough sets theory is presented. Introducing the reduction algorithm of rough sets, the data of safety visitors＇ activities are standardized and reduced, and then the most effective and simplest rules are extracted. This algorithm reduced the redundance of safe data and the burden of construction of characteristic codes. According to lower and upper approximations sets of rough sets, lower and upper approximations Self sets are constructed and the optimization and expansion of Self sets is realized, and the problem of automatically evolution of self sets is effectively resolved.

关 键 词：ROUGH集 SELF集 约简 特征码 上 下近似集 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]