检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姚光顺[1] 任倩[1] 杨传健[1] 马丽生[1]
机构地区:[1]滁州学院计算机科学与技术系,安徽滁州239000
出 处:《计算机工程与应用》2012年第7期158-160,164,共4页Computer Engineering and Applications
基 金:安徽省高校优秀青年人才基金项目(No.2009SQRZ146;2010SQRL137;2010SQRL138;2011SQRL123);滁州学院自然基金项目(No.2008kj001B);安徽省高等学校自然科学基金项目(No.KJ2011Z276;KJ2010B137)
摘 要:为解决信息系统在条件属性动态增加情况下的核属性更新问题,通过深入分析得到了一种二进制区分矩阵的等价表示方法;分析了新增条件属性对正区域和二进制区分矩阵的影响,得到一种正区域增量式计算方法,基于此提出了一种条件属性递增系统的核属性动态更新算法,该算法对已有二进制区分矩阵进行局部更新得到新的二进制区分矩阵,从而更新核属性,避免了重新计算,提高了运算速度。理论分析和实例结果验证了算法的有效性和可行性。In order to solve updating core attributes ofincremental condition attribute system, an equivalent binary discernibility matrix is proposed based on in-depth study firstly. And an algorithm for fast computing positive region in incremental condition attribute system is proposed by analyzing influence ofincreased condition attribute to the known positive region and binary discernibility matrix. Then, the updating core algorithm in incremental condition attribute system is presented. The algorithm computes binary discernibility matrix on the base of originally binary discernibility matrix by updating its portion and gets core attribute. Because the algorithm avoids computing from very beginning, so it improves the computing speed. The theoretical analysis and experimental results show the new algorithm is much more efficient and useful in computing.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49