%0 Journal Article
%T Quick Algorithm for Computing Core of the Positive Region Based on Order Relation<br>基于序关系的快速计算正区域核的算法
%A XU Zhang-yan
%A SHU Wen-hao
%A QIAN Wen-bin
%A YANG Bing-ru
%A <br>徐章艳
%A 舒文豪
%A 钱文彬
%A 杨炳儒
%J 计算机科学
%D 2010
%I 
%X At present, the main method of designing algorithm for computing the core based on the positive region is discernibility matrix In this method, the core is found by discovering all discernibility elements of discenibihty matrix So this method is very time consuming. On the foundation of the simplified decision table and simplified discernibility matrix, if the objects with condition attribute value of simplified decision table are looked as numbers, they are order. Using the order, the discernibility elements including the core may be turned into a mall quantity of research space. So the core based on the positive region can be found only by searching a small quantity of discernibility elements of the simplified discernibility matrix On this condition, an efficient computing core was designed by integrating the idea of radix sorting. The time complexity and space complexity are O(|C||U|)+O(|C|2|U/C|) and O(|C||U|) respectively.Since the core can be found by searching a small quantity of discerniblity elements of the simplified discernibility matrix in the new algorithm, the efficiency of the new algorithm is improved.
%K Rough set
%K Simplified decision table
%K Positive region
%K Core
%K Algorithm complexity<br>粗糙集
%K 简化决策表
%K 正区域
%K 核
%K 算法复杂度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=1684B004B04AEC8A70F0B0A4DCD3BB85&yid=140ECF96957D60B2&vid=42425781F0B1C26E&iid=DF92D298D3FF1E6E&sid=3D9746C06EC12B45&eid=CC0ECB9C52F1B85F&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=14